3239 search results - page 58 / 648 » A Logical Process Calculus |
CADE
2003
Springer
16 years 26 days ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
136
Voted
PPDP
1999
Springer
15 years 4 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
104
Voted
ENTCS
2008
15 years 19 days ago
2008
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
56
Voted
ENTCS
2006
15 years 17 days ago
2006
The -calculus is destructive: its main computational mechanism
93
Voted
CSL
2007
Springer
15 years 6 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...