English
Related papers

Related papers: Reduction of Many-valued into Two-valued Modal Log…

200 papers

Skolemization, with Herbrand's theorem, underpins automated theorem proving and various transformations in computer science and mathematics. Skolemization removes strong quantifiers by introducing new function symbols, enabling efficient…

Logic in Computer Science · Computer Science 2025-01-28 Matthias Baaz , Mariami Gamsakhurdia , Rosalie Iemhoff , Raheleh Jalali

Real-valued logics underlie an increasing number of neuro-symbolic approaches, though typically their logical inference capabilities are characterized only qualitatively. We provide foundations for establishing the correctness and power of…

Logic in Computer Science · Computer Science 2022-09-01 Ronald Fagin , Ryan Riegel , Alexander Gray

We introduce a generalized logic programming paradigm where programs, consisting of facts and rules with the usual syntax, can be enriched by co-facts, which syntactically resemble facts but have a special meaning. As in coinductive logic…

Programming Languages · Computer Science 2017-09-26 Davide Ancona , Francesco Dagnino , Elena Zucca

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

Structured reasoning over natural language inputs remains a core challenge in artificial intelligence, as it requires bridging the gap between unstructured linguistic expressions and formal logical representations. In this paper, we propose…

Artificial Intelligence · Computer Science 2025-07-14 Keying Yang , Hao Wang , Kai Yang

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…

Logic in Computer Science · Computer Science 2025-08-13 Tiziano Dalmonte

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

We examine the relationship of graded (multi)modal logic to counting (multichannel) message passing automata with applications to the Weisfeiler-Leman algorithm. We introduce the notion of graded multimodal types, which are formulae of…

Logic in Computer Science · Computer Science 2024-01-29 Veeti Ahvonen , Damian Heiman , Antti Kuusisto

Behavioural metrics provide a quantitative refinement of classical two-valued behavioural equivalences on systems with quantitative data, such as metric or probabilistic transition systems. In analogy to the linear-time/branching-time…

Logic in Computer Science · Computer Science 2025-01-28 Jonas Forster , Lutz Schröder , Paul Wild , Harsh Beohar , Sebastian Gurke , Barbara König , Karla Messing

We investigate some well-known (and a few not-so-well-known) many-valued logics that have a small number (3 or 4) of truth values. For some of them we complain that they do not have any \emph{logical} use (despite their perhaps having some…

Artificial Intelligence · Computer Science 2017-11-17 Allen P. Hazen , Francis Jeffry Pelletier

Autonomous agents are supposed to be able to finish tasks or achieve goals that are assigned by their users through performing a sequence of actions. Since there might exist multiple plans that an agent can follow and each plan might…

Artificial Intelligence · Computer Science 2022-04-12 Jieting Luo , Beishui Liao , Dov Gabbay

We present an algorithm for deriving a spatial-behavioral type system from a formal presentation of a computational calculus. Given a 2-monad Calc: Catv$\to$ Cat for the free calculus on a category of terms and rewrites and a 2-monad…

Logic in Computer Science · Computer Science 2016-10-18 Mike Stay , Lucius Gregory Meredith

Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…

Logic in Computer Science · Computer Science 2024-04-24 Yevgeny Kazakov , Ian Pratt-Hartmann

Following {\L}ukasiewicz, we argue that future non-certain events should be described with the use of many-valued, not 2-valued logic. The Greenberger-Horne-Zeilinger `paradox' is shown to be an artifact caused by unjustified use of…

Quantum Physics · Physics 2015-06-22 Jarosław Pykacz

Recently, multimodal large language models (MLLMs) have been widely applied to reasoning tasks. However, they suffer from limited multi-rationale semantic modeling, insufficient logical robustness, and are susceptible to misleading…

Artificial Intelligence · Computer Science 2025-12-08 Chuang Yu , Jinmiao Zhao , Mingxuan Zhao , Yunpeng Liu , Xiujun Shu , Yuanhao Feng , Bo Wang , Xiangyu Yue

Experts do not always feel very, comfortable when they have to give precise numerical estimations of certainty degrees. In this paper we present a qualitative approach which allows for attaching partially ordered symbolic grades to logical…

Artificial Intelligence · Computer Science 2013-03-25 Philippe Chatalic , Christine Froidevaux

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…

Logic · Mathematics 2020-08-19 Eveline Lehmann , Thomas Studer

The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…

Computation and Language · Computer Science 2013-09-05 Bruno Mery , Christian Retoré

The different semantics that can be assigned to a logic program correspond to different assumptions made concerning the atoms whose logical values cannot be inferred from the rules. Thus, the well founded semantics corresponds to the…

Logic in Computer Science · Computer Science 2007-05-23 Y. Loyer , N. Spyratos , D. Stamate

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby
‹ Prev 1 3 4 5 6 7 10 Next ›