The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 29 of Mathematical Reviews Vol. , Issue 88b
[page]
1988
Mathematical Reviews
Preserved Fulltext
The author also investigates deductive systems in which modus ponens is the only rule of inference. ...
This paper deals with the problem of counterfactuals and their rel- evance for artificial intelligence. ...
Deduction Beyond Satisfiability (Dagstuhl Seminar 19371)
2020
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Such problems arise in a variety of applications including the analysis of probabilistic systems (where properties like safety or liveness can be established only probabilistically), network verification ...
, to count the number of models of a formula, compute the set of all consequences of an ontology, identify missing information in a knowledge base, transform and mine proofs, or analyze probabilistic systems ...
Correct-by-Decision Solving and Applications
References 1 Amit Preferential logics are part of a family of conditional logics intended for counterfactual reasoning, allowing to infer and to withdraw ...
doi:10.4230/dagrep.9.9.23
dblp:journals/dagstuhl-reports/FuhsRST19
fatcat:j6moci5zgvgjzgpsqblemwsrlm
Nested Sequent Calculi for Conditional Logics
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain analytic and modular proof systems for these logics. ...
In this work, we extend the realm of nested sequents by providing nested sequent calculi for the basic conditional logic CK and some of its significant extensions. ...
Moreover, conditional logics can provide an axiomatic foundation of nonmonotonic reasoning [5, 15] , here a conditional A ⇒ B is read as "in normal circumstances if A then B". ...
doi:10.1007/978-3-642-33353-8_2
fatcat:sgsn55zykbf6pkqgplbfue37lu
Index—Volumes 1–89
1997
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of the utility problem 1386
characterizations
of causality 359
derivations 549
description of counterfactual implication 372
foundation for knowledge representation 282
framework for EDR strategies ...
accent assignment 1060
for arc consistency 953
for computing multilevel counterfactuals
163
for computing multilevel counterfactuals,
correctness proof for the -163
for computing probability in ...
mechanism 381 mechanized formal -152 meta-level -185 method geometric -12 17 methods choices of -1157 models inexact -906 multiple inheritance -966 multiple lines of -2 10 mundane -593 non-logical -20 nonmonotonic ...
doi:10.1016/s0004-3702(97)80122-1
fatcat:6az7xycuifaerl7kmv7l3x6rpm
Human Rationality Challenges Universal Logic
2010
Logica Universalis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Universal logic, with its origins in the principles of formal logics developed to provide foundations for mathematics as an abstract system independent of human reasoning, seems very remote from naturalistic ...
These are questions related to the cultural and psychological foundations of reasoning and the kernel of logical principles that seem to be implicit in those foundations. ...
I have used the Tarski axioms in this paper to provide a concise focus for discussion, but, for many purposes, the Gentzen sequent formulation would be better, for others model theory and for others proof ...
doi:10.1007/s11787-010-0019-9
fatcat:xbhnkoblvrhfnjkomkqcowgi5i
De Finettian Logics of Indicative Conditionals
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1901.10266v1 fatcat:4tgrdqya3naadl3tjldcz7mwwm
Here we deal with the problem of choosing an adequate notion of validity for this conditional. ...
This paper explores trivalent truth conditions for indicative conditionals, examining the "defective" table put forward by de Finetti 1936, as well as Reichenbach 1944, first sketched in Reichenbach 1935 ...
We are particularly grateful to Andrea Iacona for detailed comments, and to François Olivier for several specific references. ...
arXiv:1901.10266v2
fatcat:b7l6zm6rkjc6rnu2t6ujcemgkq
Dynamic epistemic logic in update logic
2016
Journal of Logic and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We identify axioms and inference rules that completely characterize the DEL product update and we provide a sequent calculus for DEL. ...
In parallel, we provide a sequent calculus for update logic which turns out to be a generalization of the non-associative Lambek calculus. Definition 3 (Satisfaction relation for E P × L P ). ...
I thank an anonymous referee for helpful and extensive comments. I thank Sean Sedwards for checking the English of this article. ...
doi:10.1093/logcom/exw002
fatcat:d3oybbznmrc2ththo7j4mx6wk4
Displaying updates in logic
2016
Journal of Logic and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In a companion article [7], we provide a sequent calculus for update logic which generalizes the non-associative Lambek calculus and a sequent calculus for dynamic epistemic logic which extends this sequent ...
calculus for update logic. ...
I also thank Marta Bilkova for discussions. I thank two anonymous referees for helpful and extensive comments. I thank Sean Sedwards for checking the English of this article. ...
doi:10.1093/logcom/exw001
fatcat:lymfe3tbtrh2jcbxv4crhzwmom
Nested sequent calculi for normal conditional logics
2013
Journal of Logic and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain analytic and modular proof systems for these logics. ...
In this work, we extend the realm of nested sequents by providing nested sequent calculi for the basic conditional logic CK and some of its significant extensions. ...
He did not have enough time to realize all his dreams, but he had enough time to show a great passion for his research activity. ...
doi:10.1093/logcom/ext034
fatcat:tnj7talvdvfppknml2clitkrii
Page 69 of Mathematical Reviews Vol. 25, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) 93j:68187
Brewka, Gerhard * Nonmonotonic reasoning: logical foundations of commonsense. 93b:68079
— Cumulative default logic: in defense of nonmonotonic inference rules. 93e:68118
Brown ...
(English summary) [The creativity of definitions in para-Euclidean systems] 93f:03013
Gottlob, Georg Complexity results for nonmonotonic logics. (English summary) 93i:03034
Haraguchi, M. ...
Page 1620 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) (see
COMPUTER SCIENCE
981:03006 )
Straccia, Umberto A sequent calculus for reasoning in four-valued description logics. ...
Modal logics preserving admissible for $4 inference rules. (English summary) 98d:03029
. Chiaki (with Inoue, Katsumi”) Embedding circumscriptive theories in general disjunctive programs. ...
Page 83 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Categories for computation in context and unified logic. (English summary) 98f:68170
Bonatti, Piero A. Sequent calculi for default and autoepistemic logics. ...
Modeling belief in dynamic systems. | Foundations. (English summary) 98):68149
Gabbay, Dov M. (with Rodrigues, Odinaldo (English summary) 98b:68180
Geerts, P. (with Vermeir,D.) ...
Page 88 of Mathematical Reviews Vol. 32, Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) 2000k:03059
Kotowska-Gawiejnowicz, Mirostawa A labelled deductive system for relational semantics of the Lambek calculus. ...
Conditionalization, a new argument for. (English summary) (see 2000h:03011)
Galles, David (with Pearl, Judea) An axiomatic characterization of causal counterfactuals. ...
Normative Reasoning and Consequence
2013
Dagstuhl Publications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this chapter we first provide a general introduction to the research area methodology and relevance, then we discuss normative reasoning for multi-agent systems, and finally we discuss current research ...
To emphasize this broadness, we typically refer to "deontic logic and normative systems" rather than deontic logic only. ...
We believe that deontic logic and normative systems, applying their reasoning tools, can make explicit several foundational issues in norms and games. ...
doi:10.4230/dfu.vol4.12111.33
dblp:conf/dagstuhl/BroersenCEGGLPTTTS13
fatcat:nnmadfn5f5fizgskvjwly3cnce
Proceedings of the Conference on Hypothetical Reasoning, 23-24 August 2014, Tübingen
[article]
2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Reasoning focussed on its logical aspects, such as assumption-based calculi and their proof theory, logical consequence from a proof-theoretic or model-theoretic point of view, logics of conditionals, proof systems ...
calculi, we prove that the derivations normalize; while, as for the sequent calculi, we prove they are contraction-free, weakening-free and cut-free and that their logical rules are all invertible. ...
Gentzen-style systems operate on sequents. • A sequent: an expression of the form Γ ⇒ ∆, where Γ, ∆ are finite sets of L-formulas. • A standard Gentzen-type system for L consists of: 1. ...
doi:10.15496/publikation-415
fatcat:6dczl7znujbiphltjn55uant6i
« Previous
Showing results 1 — 15 out of 24 results