7991 search results - page 370 / 1599 » Using More Reasoning to Improve |
185
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
150
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
194
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
162
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
164
Voted
TARK
2007
Springer
16 years 28 days ago
2007
Springer
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...