English
Related papers

Related papers: Bilateral base-extension semantics

200 papers

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…

Formal Languages and Automata Theory · Computer Science 2024-02-16 C. Aiswarya , Amaldev Manuel , Saina Sunny

Mathematical proofs are often said to justify their conclusions by indicating the existence of a corresponding formal derivation. We argue that this widespread view relies on an under-examined notion of correspondence, or what it means for…

History and Overview · Mathematics 2026-03-20 Simon DeDeo , Eamon Duede

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications. These justifications are expressed in terms of causal graphs…

Artificial Intelligence · Computer Science 2014-09-26 Pedro Cabalar , Jorge Fandinno , Michael Fink

Refutation calculi are formal systems developed to derive the invalid formulas of a given logic. While the notion of refutation calculi has played a key role in the development of tableaux calculi, a refutation approach to display calculi…

The symbol grounding problem asks how tokens like cat can be about cats, as opposed to mere shapes manipulated in a calculus. We recast grounding from a binary judgment into an audit across desiderata, each indexed by an evaluation tuple…

Artificial Intelligence · Computer Science 2026-01-01 Daniel Quigley , Eric Maynard

Formal argumentation is being used increasingly in artificial intelligence as an effective and understandable way to model potentially conflicting pieces of information, called arguments, and identify so-called acceptable arguments…

Artificial Intelligence · Computer Science 2026-03-09 Yann Munro , Isabelle Bloch , Marie-Jeanne Lesot

Negation is both an operation in formal logic and in natural language by which a proposition is replaced by one stating the opposite, as by the addition of "not" or another negation cue. Treating negation in an adequate way is required for…

Computation and Language · Computer Science 2021-10-14 Claudia Schon , Sophie Siebert , Frieder Stolzenburg

Fundamental duality is a concept which refers to two irreducible, heterogeneous principles which are in opposite and complementary of each other. The complementary principle in quantum mechanics is also praised by Bohr. This important…

General Physics · Physics 2023-01-31 B. T. T. Wong

Two salient notions of sameness of theories are synonymy, also known as definitional equivalence, and bi-interpretability. Of these two definitional equivalence is the strictest notion. In which cases can we infer synonymy from…

Logic · Mathematics 2025-09-03 Harvey M. Friedman , Albert Visser

When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an arbitrary set of axioms is hard, even for relatively…

Logic in Computer Science · Computer Science 2007-05-23 Ian Horrocks , Stephan Tobies

Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing. The paper describes a preferential approach for dealing with exceptions in Description Logics, based on the rational…

Artificial Intelligence · Computer Science 2018-07-10 Laura Giordano , Valentina Gliozzi

Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded…

Artificial Intelligence · Computer Science 2022-04-08 Martin Caminada , Sri Harikrishnan

In many real-life settings, agents must navigate dynamic environments while reasoning under incomplete information and acting on a corpus of unstable, context-dependent, and often conflicting norms. We introduce a general, non-modal,…

Logic in Computer Science · Computer Science 2025-12-23 Mario Piazza , Andrea Sabatini

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

Computational Complexity · Computer Science 2010-09-13 Michael Thomas , Heribert Vollmer

This paper concerns the development of metatheory for extensible languages. It uses as its starting point a view that programming languages tailored to specific application domains are to be constructed by composing components from an open…

Programming Languages · Computer Science 2023-12-25 Dawn Michaelson , Gopalan Nadathur , Eric Van Wyk

We present syntactic characterisations for the union closed fragments of existential second-order logic and of logics with team semantics. Since union closure is a semantical and undecidable property, the normal form we introduce enables…

Logic in Computer Science · Computer Science 2023-06-22 Matthias Hoelzel , Richard Wilke

The main aim of this paper is to make a remark about the relation between (i) dualities between theories, as `duality' is understood in physics and (ii) equivalence of theories, as `equivalence' is understood in logic and philosophy. The…

History and Philosophy of Physics · Physics 2018-06-06 Jeremy Butterfield

Reactive systems \`a la Leifer and Milner, an abstract categorical framework for rewriting, provide a suitable framework for deriving bisimulation congruences. This is done by synthesizing interactions with the environment in order to…

Logic in Computer Science · Computer Science 2023-07-14 Mathias Hülsbusch , Barbara König , Sebastian Küpper , Lara Stoltenow
‹ Prev 1 8 9 10 Next ›