English
Related papers

Related papers: Product closure of some second-order modal logics

200 papers

The deontic logic DUS is a Deontic Update Semantics for prescriptive obligations based on the update semantics of Veltman. In DUS the definition of logical validity of obligations is not based on static truth values but on dynamic action…

Artificial Intelligence · Computer Science 2013-01-30 Leendert van der Torre , Yao-Hua Tan

In this paper, we address the logic of knowing why, an example of a non-standard epistemic logic dealing with justified knowledge via a new epistemic operator, under the extensions with ideas from dynamic epistemic logic, namely public…

Logic · Mathematics 2018-09-24 Nicholas Pischke

A new categorical framework is provided for dealing with multiple arguments in a programming language with effects, for example in a language with imperative features. Like related frameworks (Monads, Arrows, Freyd categories), we…

Category Theory · Mathematics 2007-07-11 Jean-Guillaume Dumas , Dominique Duval , Jean-Claude Reynaud

The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing…

Artificial Intelligence · Computer Science 2007-05-23 Richard Booth

Belief revision is an operation that aims at modifying old beliefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalisms, in particular, in qualitative algebras (QAs) in which the…

Artificial Intelligence · Computer Science 2014-05-06 Valmi Dufour-Lussier , Alice Hermann , Florence Le Ber , Jean Lieber

Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…

Logic in Computer Science · Computer Science 2025-03-04 Ali K. Caires-Santos , Maribel Fernández , Daniele Nantes-Sobrinho

We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider…

Logic in Computer Science · Computer Science 2025-06-18 Annalisa Bossi , Nicoletta Cocco , Sandro Etalle , Sabina Rossi

In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal')…

Logic in Computer Science · Computer Science 2015-12-29 Christopher Hampson , Stanislav Kikot , Agi Kurucz

We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a…

Logic in Computer Science · Computer Science 2015-07-01 Juha Kontinen , Heribert Vollmer

Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…

Logic · Mathematics 2016-01-13 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli

Modality is the linguistic ability to describe events with added information such as how desirable, plausible, or feasible they are. Modality is important for many NLP downstream tasks such as the detection of hedging, uncertainty,…

Computation and Language · Computer Science 2021-06-16 Valentina Pyatkin , Shoval Sadde , Aynat Rubinstein , Paul Portner , Reut Tsarfaty

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…

Artificial Intelligence · Computer Science 2011-06-10 F. Baader , C. Lutz , H. Sturm , F. Wolter

Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive…

Logic in Computer Science · Computer Science 2018-06-29 Liron Cohen , Reuben N. S. Rowe

Dependence is an important concept for many tasks in artificial intelligence. A task can be executed more efficiently by discarding something independent from the task. In this paper, we propose two novel notions of dependence in…

Artificial Intelligence · Computer Science 2019-06-13 Liangda Fang , Hai Wan , Xianqiao Liu , Biqing Fang , Zhaorong Lai

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…

Logic · Mathematics 2014-11-04 Danko Ilik

We present a novel formalization of counterfactual conditionals in a quantified modal logic. Counterfactual conditionals play a vital role in ethical and moral reasoning. Prior work has shown that moral reasoning systems (and more…

Artificial Intelligence · Computer Science 2017-11-06 Naveen Sundar Govindarajulu , Selmer Bringsjord

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

In modal logic, semantic consequence is usually defined locally by truth preservation at all worlds in all models (with respect to a class of frames). It can also be defined globally by truth preservation in all models (with respect to a…

Logic in Computer Science · Computer Science 2019-10-08 Xuefeng Wen

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson
‹ Prev 1 4 5 6 7 8 10 Next ›