Results 31 to 40 of about 1,151,417 (307)
On Argumentation Logic and Propositional Logic
Studia Logica: An International Journal for Symbolic Logic, 2017 This paper studies the relationship between Argumentation Logic (AL), a recently defined logic based on the study of argumentation in AI, and classical Propositional Logic (PL). In particular, it shows that AL and PL are logically equivalent in that they
A. Kakas, P. Mancarella, Francesca Toni
semanticscholar +1 more source
Sequent calculus for propositional likelihood logic
Lietuvos Matematikos Rinkinys, 2023 There is not abstract.
Romas Alonderis
doaj +3 more sources
Schema Complexity in Propositional-Based Logics
Mathematics, 2021 The essential structure of derivations is used as a tool for measuring the complexity of schema consequences in propositional-based logics. Our schema derivations allow the use of schema lemmas and this is reflected on the schema complexity.
Jaime Ramos +2 more
doaj +1 more source
Formal Logic for Informal Logicians
Informal Logic, 2008 Classical logic yields counterintuitive results for numerous propositional argument forms. The usual alternatives (modal logic, relevance logic, etc.) generate counterintuitive results of their own. The counterintuitive results create problems—especially
David Sherry
doaj +1 more source
The Complexity of Reasoning for Fragments of Default Logic [PDF]
, 2009 Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as $\SigmaPtwo$-complete, and the complexity of the credulous and skeptical reasoning problem as
A.L. Selman +15 more
core +4 more sources
A Neighbourhood Semantics for the Logic TK
Principia: An International Journal of Epistemology, 2011 The logic TK was introduced as a propositional logic extending the classical propositional calculus with a new unary operator which interprets some conceptions of Tarski’s consequence operator. TK-algebras were introduced as models to TK.
Hércules de Araújo Feitosa +1 more
doaj +3 more sources
On the Expressive Power of Sub-Propositional Fragments of Modal Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Modal logic is a paradigm for several useful and applicable formal systems in computer science. It generally retains the low complexity of classical propositional logic, but notable exceptions exist in the domains of description, temporal, and spatial ...
Davide Bresolin +2 more
doaj +1 more source
Reasoning about Minimal Belief and Negation as Failure
, 2011 We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including ...
Rosati, R.
core +1 more source
Well structured program equivalence is highly undecidable [PDF]
, 2011 We show that strict deterministic propositional dynamic logic with intersection is highly undecidable, solving a problem in the Stanford Encyclopedia of Philosophy. In fact we show something quite a bit stronger.
Balbiani P. +4 more
core +1 more source
Philosophia Scientiæ, 2015 In Hintikka's philosophy the notion of analyticity occupies a special place (e.g., [Hintikka 1973], [Hintikka 2007]); in particular, the Finnish thinker distinguishes two notions of analyticity—one based on the concept of information, the other on the ...
Francesca Poggiolesi
doaj +1 more source