English
Related papers

Related papers: PUC-Logic embedding of Lewis' Deontic Logics

200 papers

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

Logic · Mathematics 2017-01-05 Daniel Murfet

Logical reasoning, i.e., deductively inferring the truth value of a conclusion from a set of premises, is an important task for artificial intelligence with wide potential impacts on science, mathematics, and society. While many…

Computation and Language · Computer Science 2024-02-15 Theo X. Olausson , Alex Gu , Benjamin Lipkin , Cedegao E. Zhang , Armando Solar-Lezama , Joshua B. Tenenbaum , Roger Levy

A semantic embedding of (constant domain) quantified conditional logic in classical higher-order logic is presented.

Artificial Intelligence · Computer Science 2012-04-27 Christoph Benzmueller , Valerio Genovese

A large amount of research about multimodal inference across text and vision has been recently developed to obtain visually grounded word and sentence representations. In this paper, we use logic-based representations as unified meaning…

Computation and Language · Computer Science 2019-06-11 Riko Suzuki , Hitomi Yanaka , Masashi Yoshikawa , Koji Mineshima , Daisuke Bekki

In this paper we present the core of LoCo, a logic-based high-level representation language for expressing configuration problems. LoCo shall allow to model these problems in an intuitive and declarative way, the dynamic aspects of…

Logic in Computer Science · Computer Science 2011-09-02 Markus Aschinger , Conrad Drescher , Georg Gottlob

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

We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.

Logic · Mathematics 2009-05-07 Karim Nour , Christophe Raffalli

We endow prioritised default logic (PDL) with argumentation semantics using the ASPIC+ framework for structured argumentation, and prove that the conclusions of the justified arguments are exactly the prioritised default extensions.…

Artificial Intelligence · Computer Science 2015-07-02 Anthony P. Young , Sanjay Modgil , Odinaldo Rodrigues

Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for…

Logic in Computer Science · Computer Science 2020-09-29 Leonard Botha , Thomas Meyer , Rafael Peñaloza

Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define many logical systems such as separation logic with recursive…

Logic in Computer Science · Computer Science 2022-09-22 Péter Bereczky , Xiaohong Chen , Dániel Horpácsi , Lucas Peña , Jan Tušil

Coalition logic is one of the most popular logics for multi-agent systems. While epistemic extensions of coalition logic have received much attention, existence of their complete axiomatisations has so far been an open problem. In this…

Logic in Computer Science · Computer Science 2011-07-04 Thomas Ågotnes , Natasha Alechina

In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…

Logic in Computer Science · Computer Science 2019-05-15 Marcelo Finger

Deep learning is very effective at jointly learning feature representations and classification models, especially when dealing with high dimensional input patterns. Probabilistic logic reasoning, on the other hand, is capable to take…

Machine Learning · Computer Science 2019-01-15 Giuseppe Marra , Francesco Giannini , Michelangelo Diligenti , Marco Gori

Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and…

Logic in Computer Science · Computer Science 2019-09-05 Vlad Rusu , David Nowak

In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with `decorations' that describe what computational (side) effect evaluation of a term may involve. In a point-free categorical…

Logic in Computer Science · Computer Science 2018-10-17 Burak Ekici

This paper generalizes the encoding of argumentation frameworks beyond the classical 2-valued propositional logic system ($PL_2$) to 3-valued propositional logic systems ($PL_3$s) and fuzzy propositional logic systems ($PL_{[0,1]}s$),…

Artificial Intelligence · Computer Science 2025-08-19 Shuai Tang , Jiachao Wu , Ning Zhou

This chapter provides an introduction to some basic concepts of epistemic logic, basic formal languages, their semantics, and proof systems. It also contains an overview of the handbook, and a brief history of epistemic logic and pointers…

Artificial Intelligence · Computer Science 2015-03-04 Hans van Ditmarsch , Joseph Y. Halpern , Wiebe van der Hoek , Barteld Kooi

Deontic logic is shown to be applicable for modelling human reasoning. For this the Wason selection task and the suppression task are discussed in detail. Different versions of modelling norms with deontic logic are introduced and in the…

Artificial Intelligence · Computer Science 2014-09-19 Ulrich Furbach , Claudia Schon

Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies which "behave well" and react in the same way to a set of tests. The…

Logic in Computer Science · Computer Science 2015-07-01 Claudia Faggian , Michele Basaldella

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema
‹ Prev 1 3 4 5 6 7 10 Next ›