123 search results - page 18 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted first-order abstract syntax with variable names so that the formalizati...
88
Voted
APAL
2008
14 years 9 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
84
Voted
ENTCS
2008
14 years 9 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
BIRTHDAY
2010
Springer
14 years 7 months ago
2010
Springer
We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural...
ICAIL
2007
ACM
15 years 1 months ago
2007
ACM
Ontologies in a legal expert system must be processed to suit all possible user cases within the field of law of the system. From the logical premises of a deductive system of expr...