2490 search results - page 160 / 498 » Complexity of Contextual Reasoning |
139
click to vote
LPNMR
1997
Springer
15 years 8 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
125
click to vote
LPAR
1994
Springer
15 years 8 months ago
1994
Springer
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
153
click to vote
ECAI
1998
Springer
15 years 8 months ago
1998
Springer
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
143
click to vote
ITP
2010
15 years 8 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
143
click to vote
DLOG
2006
15 years 6 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...