5550 search results - page 42 / 1110 » Different Approaches to Proof Systems |
145
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
146
click to vote
KI
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
177
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
145
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
179
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...