Theorem proving for conditional logics: CondLean and GOALDUCK
نویسندگان
چکیده
منابع مشابه
Theorem proving for conditional logics: CondLean and GOALDUCK
In this paper we focus on theorem proving for conditional logics. First, we give a detailed description of CondLean, a theorem prover for some standard conditional logics. CondLean is a SICStus Prolog implementation of some labeled sequent calculi for conditional logics recently introduced. It is inspired to the so called “lean” methodology, even if it does not fit this style in a rigorous mann...
متن کاملNested Sequent Calculi and Theorem Proving for Normal Conditional Logics
In this paper we focus on proof methods and theorem proving for normal conditional logics, by describing nested sequent calculi as well as a theorem prover for them. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain ...
متن کاملTableau-Based Theorem Proving In Normal Conditional Logics
This paper presents an extension of the semantic tableaux approach to theorem proving for the class of normal conditional logics. These logics are based on a possible worlds semantics, but contain a binary “variable conditional” operator =E= instead of the usual operator for necessity. The truth of A +B depends both on the accessibility relation between worlds, and on the proposition expressed ...
متن کاملResolution-Based Theorem Proving for Manyvalued Logics
A general approach to automated theorem proving for all rst-order nite-valued logics that can be deened truth-functionally is described. The suggested proof procedure proceeds in two, largely independent, steps. First, logic-speciic translation calculi are used to generate clause forms for arbitrary formulas of a many-valued logic. The worst-case complexity of the translation rules is analysed ...
متن کاملResolution-Based Theorem Proving for SHn-Logics
In this paper we illustrate by means of an example, namely SHn-logics, a method for translation to clause form and automated theorem proving for first-order many-valued logics based on distributive lattices with operators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Non-Classical Logics
سال: 2008
ISSN: 1166-3081,1958-5780
DOI: 10.3166/jancl.18.427-473