851 search results - page 44 / 171 » Inaccessibility in Decision Procedures |
CADE
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a DPLL calculus that is a decision procedure for the Bernays-Sch
IJCAI
2001
13 years 9 months ago
2001
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...