247 search results - page 8 / 50 » A Computational Structure for the Propositional Calculus |
TCS
2010
13 years 5 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
CADE
2004
Springer
14 years 7 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
LFCS
2009
Springer
14 years 1 months ago
2009
Springer
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
RR
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we present an embedding of propositional production systems into µ-calculus, and first-order production systems into fixed-point logic, with the aim of using these...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...