23 search results - page 1 / 5 » A propositional theorem prover to solve planning and other p... |
AMAI
1999
Springer
13 years 4 months ago
1999
Springer
CAV
2003
Springer
13 years 10 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
IJCAI
1997
13 years 6 months ago
1997
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reaso...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
CADE
2012
Springer
11 years 7 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...