2214 search results - page 111 / 443 » Complexity of Reasoning |
109
Voted
LPAR
1994
Springer
15 years 7 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...
143
Voted
ECAI
1998
Springer
15 years 7 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...
131
click to vote
ITP
2010
15 years 7 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...
132
click to vote
DLOG
2006
15 years 4 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 ...
DLOG
1996
15 years 4 months ago
1996
Designing a DL system poses the problem of the trade-o between power of expression and complexity. In spite of their rich expressive capacity, the or and not constructors are usua...