Conditional logic of actions and causation

Giordano, Laura; Schwind, Camilla

doi:10.1016/j.artint.2004.04.009

Cited by 27 publications

(28 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For a broader discussion on plausible interpretations of conditionals, we remind the reader to (Schwind, 1999;Giordano et al, 2004;Gabbay et al, 2000a); here we just observe that they have been widely used to express update/action/causation. We show that the goal "Having set the DVD recorder on, is it ready to record?…”

Section: Examples In Us'mentioning

confidence: 99%

“…Recently, conditional logics have found interesting applications in several areas of computer science and artificial intelligence, such as knowledge representation, non-monotonic reasoning (Delgrande, 1987;Kraus et al, 1990;Crocco et al, 1992;Friedman et al, 2001;Giordano et al, 2005b), deductive databases (Gabbay et al, 2000a), belief revision (Grahne, 1998;Giordano et al, 2005a;Giordano et al, 2002) and natural language semantics (Costello et al, 1999). Conditional logics have also been used to model causal inference and reasoning about action execution in planning (Schwind, 1999;Giordano et al, 2004).…”

mentioning

confidence: 99%

See 1 more Smart Citation

Theorem proving for conditional logics: CondLean and GOALDUCK

Olivetti

Pozzato

2008

Journal of Applied Non-Classical Logics

View full text Add to dashboard Cite

Section: Examples In Us'mentioning

confidence: 99%

mentioning

confidence: 99%

Theorem proving for conditional logics: CondLean and GOALDUCK

Olivetti

Pozzato

2008

Journal of Applied Non-Classical Logics

View full text Add to dashboard Cite

“…E.g., modus ponens is a reasonable principle for interpretations of the conditional as a relevant implication or as a counterfactual, but not for default implication; conditional excluded middle is a controversially discussed property of the subjunctive conditional [6]. The identity axiom, while accepted for many interpretations of the conditional including as default implication, is typically rejected for causal interpretations [8]. Rules with more than one premise arise through saturation of a given rule set under cut that, e.g.…”

Section: Modal Deduction Systemsmentioning

confidence: 99%

Generic Modal Cut Elimination Applied to Conditional Logics

Pattinson¹,

Schröder²

2011

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal modal logic. We give extensive example instantiations of our framework to various conditional logics. For these, we obtain fully internalised calculi which are substantially simpler than those known in the literature, along with leaner proofs of cut elimination and complexity. In one case, conditional logic with modus ponens and conditional excluded middle, cut elimination and complexity were explicitly stated as open in the literature.

show abstract

“…-to formalize causal inference and reasoning about action execution in diagnosis [16,29] and planning [33,20]: in this context, a conditional formula A ⇒ B is interpreted as "A causes B"; -to formalize epistemic change in a multi-agent setting and in some kind of epistemic "games" [3,7]: here, each conditional operator expresses the "conditional beliefs" of an agent.…”

Section: Introductionmentioning

confidence: 99%

Nested sequent calculi and theorem proving for normal conditional logics: The theorem prover NESCOND

Olivetti

Pozzato

2015

View full text Add to dashboard Cite

Abstract. 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. We first present some nested sequent calculi, recently introduced, for the basic conditional logic CK and some of its significant extensions with axioms ID, MP and CEM. We also describe a calculus for the flat fragment of the conditional logic CK+CSO+ID, which corresponds to Kraus, Lehmann and Magidor's cumulative logic C. The calculi are internal, cut-free and analytic. Next, we describe NESCOND, a Prolog implementation of these calculi in the style of leanT A P. We finally present an experimental comparison between our theorem prover NESCOND and other known theorem provers for conditional logics. Our tests show that the performances of NESCOND are promising and in all cases better, with the only exception of systems including CEM, than those ones of the other provers. The program NESCOND, as well as all the Prolog source files, are available at http://www.di.unito.it/∼pozzato/nescond/.

show abstract

Conditional logic of actions and causation

Cited by 27 publications

References 31 publications

Theorem proving for conditional logics: CondLean and GOALDUCK

Theorem proving for conditional logics: CondLean and GOALDUCK

Generic Modal Cut Elimination Applied to Conditional Logics

Nested sequent calculi and theorem proving for normal conditional logics: The theorem prover NESCOND

Contact Info

Product

Resources

About