English
Related papers

Related papers: Generalized Explosion Principles: A Semantic Persp…

200 papers

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…

Logic in Computer Science · Computer Science 2016-08-05 Amelia Harrison , Vladimir Lifschitz

We propose a new definition of actual causes, using structural equations to model counterfactuals.We show that the definitions yield a plausible and elegant account ofcausation that handles well examples which have caused problems forother…

Artificial Intelligence · Computer Science 2013-01-14 Joseph Y. Halpern , Judea Pearl

In this paper, we discuss necessary and sufficient explanations for formal argumentation - the question whether and why a certain argument can be accepted (or not) under various extension-based semantics. Given a framework with which…

Artificial Intelligence · Computer Science 2020-11-05 AnneMarie Borg , Floris Bex

From an inconsistent database non-trivial arguments may be constructed both for a proposition, and for the contrary of that proposition. Therefore, inconsistency in a logical database causes uncertainty about which conclusions to accept.…

Artificial Intelligence · Computer Science 2013-08-12 Morten Elvang-Gøransson , Paul J. Krause , John Fox

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…

Logic in Computer Science · Computer Science 2018-04-25 AnneMarie Borg

This paper proposes a way to compute the meanings associated with sentences with generic noun phrases corresponding to the generalized quantifier most. We call these generics specimens and they resemble stereotypes or prototypes in lexical…

Logic · Mathematics 2012-03-12 Christian Retoré

Recent authors have proposed analyzing conditional reasoning through a notion of intervention on a simulation program, and have found a sound and complete axiomatization of the logic of conditionals in this setting. Here we extend this…

Artificial Intelligence · Computer Science 2018-07-31 Duligur Ibeling

We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…

Logic in Computer Science · Computer Science 2026-01-01 Prosenjit Howlader , Churn-Jung Liau

We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax…

Artificial Intelligence · Computer Science 2025-06-17 Joohyung Lee , Yi Wang

In Dung-style abstract argumentation, various semantics capture notions of acceptability of arguments. The admissibility semantics capture the notion that an argument can be consistently defended from any potential counterargument. Weak…

Artificial Intelligence · Computer Science 2026-05-05 Uri Andrews , Luca San Mauro , John Spoerl

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

Logic in Computer Science · Computer Science 2014-01-17 Vincent Aravantinos , Ricardo Caferra , Nicolas Peltier

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

Logic in Computer Science · Computer Science 2017-03-08 Lidia Tendera

We define a modular multi-concept extension of the lexicographic closure semantics for defeasible description logics with typicality. The idea is that of distributing the defeasible properties of concepts into different modules, according…

Artificial Intelligence · Computer Science 2020-09-07 Laura Giordano , Daniele Theseider Dupré

Logic has proved essential for formally modeling software based systems. Such formal descriptions, frequently called specifications, have served not only as requirements documentation and formalisation, but also for providing the…

Logic in Computer Science · Computer Science 2021-07-20 Carlos G. Lopez Pombo , Thomas S. E. Maibaum

This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds.…

Formal Semantics and Distributional Semantics are two important semantic frameworks in Natural Language Processing (NLP). Cognitive Semantics belongs to the movement of Cognitive Linguistics, which is based on contemporary cognitive…

Computation and Language · Computer Science 2017-09-26 Kun Xing

This paper is devoted to show the advantages of introducing a geometric viewpoint and a non extensive formulation in the description of apparently unrelated phenomena: combustion and earthquakes. Here, it is shown how the introduction of a…

Geophysics · Physics 2007-05-23 Oscar Sotolongo-Costa , Antonio Posadas

Counterfactual reasoning and contextuality is defined and critically evaluated with regard to its nonempirical content. To this end, a uniqueness property of states, explosion views and link observables are introduced. If only a single…

Quantum Physics · Physics 2009-11-10 Karl Svozil

Existential rules form an expressive Datalog-based language to specify ontological knowledge. The presence of existential quantification in rule-heads, however, makes the main reasoning tasks undecidable. To overcome this limitation, in the…

Computational Complexity · Computer Science 2023-07-25 Georg Gottlob , Marco Manna , Cinzia Marte