226 search results - page 20 / 46 » BDDs and Automated Deduction |
ELP
1993
13 years 11 months ago
1993
We describe how the calculus of partial inductive definitions is used to represent logics. This calculus includes the powerful principle of definitional reflection. We describe two...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
AIMSA
1990
Springer
13 years 11 months ago
1990
Springer
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...