Sciweavers

7 search results - page 2 / 2
» A Resolution Decision Procedure for the Guarded Fragment
Sort
View
AAAI
1998
13 years 7 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
ASE
2005
140views more  ASE 2005»
13 years 5 months ago
Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Steve Roach, Jeffrey Van Baalen