This dissertation addresses some problems raised by the well-known intractability of deductive reasoning in even moderately expressive knowledge representation systems. Starting from boolean constraint propagation (BCP), a previously known linear-time incomplete reasoner for clausal propositional theories, we develop fact propagation (FP) to deal with non-clausal theories, after motivating the need for such an extension. FP is specified using a confluent rewriting systems, for which we present an algorithm that has quadratic-time complexity in general, but is still linear-time for clausal theories. FP is the only known tractable extension of BCP to non-clausal theories; we prove that it performs strictly more inferences than CNF-BCP, a prev...
In the constraint satisfaction problem (CSP) formulation used in artificial intelligence, the variab...
International audienceWe consider logic-based argumentation in which an argument is a pair (Phi, alp...
Knowledge Representation and Reasoning is the area of artificial intelligence that is concerned with...
with Disjunctive Information This work proposes a new methodology for establishing the tractability ...
This work proposes a new methodology for establish-ing the tractability of a reasoning service that ...
This thesis is composed of three separate, yet related strands. They have in common the notion that...
AbstractMany AI problems, when formalized, reduce to evaluating the probability that a propositional...
We develop a model-based approach to reasoning, in which the knowledge base is represented as a set ...
AbstractAbduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations ...
AbstractWe develop a model-based approach to reasoning, in which the knowledge base is represented a...
Many AI problems, when formulated, reduce to evaluating the probability that a prepositional express...
In this paper we present a general representation for constraint satisfaction problems (CSP) and a -...
Abstract. Knowledge representation and reasoning leads to a wide range of computational problems, an...
Many tasks require "reasoning" --- i.e., deriving conclusions from a corpus of explicitly ...
AbstractMany relevant intractable problems become tractable if some problem parameter is fixed. Howe...
In the constraint satisfaction problem (CSP) formulation used in artificial intelligence, the variab...
International audienceWe consider logic-based argumentation in which an argument is a pair (Phi, alp...
Knowledge Representation and Reasoning is the area of artificial intelligence that is concerned with...
with Disjunctive Information This work proposes a new methodology for establishing the tractability ...
This work proposes a new methodology for establish-ing the tractability of a reasoning service that ...
This thesis is composed of three separate, yet related strands. They have in common the notion that...
AbstractMany AI problems, when formalized, reduce to evaluating the probability that a propositional...
We develop a model-based approach to reasoning, in which the knowledge base is represented as a set ...
AbstractAbduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations ...
AbstractWe develop a model-based approach to reasoning, in which the knowledge base is represented a...
Many AI problems, when formulated, reduce to evaluating the probability that a prepositional express...
In this paper we present a general representation for constraint satisfaction problems (CSP) and a -...
Abstract. Knowledge representation and reasoning leads to a wide range of computational problems, an...
Many tasks require "reasoning" --- i.e., deriving conclusions from a corpus of explicitly ...
AbstractMany relevant intractable problems become tractable if some problem parameter is fixed. Howe...
In the constraint satisfaction problem (CSP) formulation used in artificial intelligence, the variab...
International audienceWe consider logic-based argumentation in which an argument is a pair (Phi, alp...
Knowledge Representation and Reasoning is the area of artificial intelligence that is concerned with...