725 search results - page 29 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
119
click to vote
JAR
2002
15 years 2 months ago
2002
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
109
click to vote
EUROCOLT
1999
Springer
15 years 6 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
146
click to vote
ATAL
1997
Springer
15 years 6 months ago
1997
Springer
We briefly overview the architecture of a diagnosis agent. We employ logic and logic programming to specify and implement the agent: the knowledge base uses extended logic progra...
145
click to vote
DAGSTUHL
2001
15 years 3 months ago
2001
A powerful approach to finding errors in computer software is to translate a given program into a verification condition, a logical formula that is valid if and only if the program...
114
click to vote
PADL
2004
Springer
15 years 7 months ago
2004
Springer
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...