Sciweavers

204 search results - page 7 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
AAAI
1993
14 years 11 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
TABLEAUX
2000
Springer
15 years 1 months ago
A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
Alberto Artosi, Guido Governatori, Antonino Rotolo
PPDP
2005
Springer
15 years 3 months ago
Monadic concurrent linear logic programming
Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In th...
Pablo López, Frank Pfenning, Jeff Polakow, ...
LPAR
2004
Springer
15 years 2 months ago
The Inverse Method for the Logic of Bunched Implications
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, S...
174
Voted
POPL
2007
ACM
15 years 9 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty