Searching for authors named "Pierre Marquis" – sorted by Relevance.
-
Une Approche Logique De La Définissabilité
- Dans cet article nous pr'esentons une notion de d'ependance en logique propositionnelle : la d'efinissabilit 'e. Intuitivement, un ensemble de variables propositionnelles X d'efinit une variable propositionnelle y sachant une base de connaissances \Sigma si et seulement si la connaissance des
- Add To MetaCart
-
Rule-Based Classification without Rules thanks to Instance-Based Learning
- A new approach to learning from examples, called scope classification, is introduced. Close to Instance-Based Learning, scope classification is at the core of rule-based classification.
- Add To MetaCart
-
Three-valued Logics for Inconsistency Handling
- While three-valued paraconsistent logic is a valuable framework for reasoning under inconsistency, the corresponding basic inference relation is too cautious and fails in discriminating in a fine-grained way the set of expected consequences of belief bases. To address both issues, we point out more
- Cited by 1 (0 self) – Add To MetaCart
-
Some Computational Aspects of DISTANCE-SAT
- rue de l’Université- S.P. 16
- Cited by 2 (0 self) – Add To MetaCart
-
A Model for Generalization based on Confirmatory Induction
- Confirmatory induction is based on the assumption that unknown individuals are similar to known ones, i.e. they satisfy the properties shared by known individuals. This assumption can be represented inside a non-monotonic logical framework. Accordingly, existing approaches to confirmatory induction
- Cited by 2 (1 self) – Add To MetaCart
-
Abduction, Induction and Completion Policies
- . In this paper, we are mainly concerned with abduction and confirmatory induction. While both reasoning models can be related to deduction w.r.t. a completed knowledge base, we claim that they do not basically rely on the same completion policies. Intuitively, induction requires individuals of the
- Cited by 2 (1 self) – Add To MetaCart
-
A Perspective on Knowledge Compilation
- We provide a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime. We argue that
- Cited by 22 (8 self) – Add To MetaCart
-
Compilation of Propositional Weighted Bases
- In this paper, we investigate the extent to which knowledge compilation can be used to improve inference from propositional weighted bases. We present a general notion of compilation of a weighted base that is parametrized by any equivalence--preserving compilation function.
- Cited by 14 (4 self) – Add To MetaCart
-
Knowledge Compilation Properties of Trees-of-BDDs, Revisited ∗
- Recent results have shown the interest of trees-of-BDDs [Subbarayan et al., 2007] as a suitable target language for propositional knowledge compilation from the practical side. In the present paper, the concept of tree-of-BDDs is extended to additional classes of data structures C thus leading to tr
- Add To MetaCart
-
A Knowledge Compilation Map
- We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime.
- Cited by 75 (10 self) – Add To MetaCart

