English
Related papers

Related papers: Conditional logic as a short-circuit logic

200 papers

We study the logic of comparative concept similarity $\CSL$ introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In this logic we can formulate assertions of the form " objects…

Artificial Intelligence · Computer Science 2009-02-06 Régis Alenda , Nicola Olivetti , Camilla Schwind

The present work aims to give a unity of logic via standard sequential, unpolarized games. Specifically, our vision is that there must be mathematically precise concepts of linear refinement and intuitionistic restriction of logic such that…

Logic · Mathematics 2019-12-17 Norihiro Yamada

We present a consequence-based calculus for concept subsumption and classification in the description logic ALCHOIQ, which extends ALC with role hierarchies, inverse roles, number restrictions, and nominals. By using standard…

Artificial Intelligence · Computer Science 2018-05-04 David Tena Cucala , Bernardo Cuenca Grau , Ian Horrocks

Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any…

Logic in Computer Science · Computer Science 2013-12-18 James Cheney

We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this…

Logic · Mathematics 2017-03-21 Hongwei Xi , Hanwen Wu

In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, considering a classical…

Logic in Computer Science · Computer Science 2023-07-24 Eben Blaisdell , Max I. Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

We introduce isotonic conditional laws (ICL) which extend the classical notion of conditional laws by the additional requirement that there exists an isotonic relationship between the random variable of interest and the conditioning random…

Statistics Theory · Mathematics 2024-03-13 Sebastian Arnold , Johanna Ziegel

Inclusion logic is a variant of dependence logic that was shown to have the same expressive power as positive greatest fixed-point logic. Inclusion logic is not axiomatizable in full, but its first-order consequences can be axiomatized. In…

Logic · Mathematics 2020-01-22 Fan Yang

The recursive logit (RL) model has become a widely used framework for route choice modeling, but it suffers from a key limitation: it assigns nonzero probabilities to all paths in the network, including those that are unrealistic, such as…

Econometrics · Economics 2025-09-03 Hung Tran , Tien Mai , Minh Ha Hoang

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…

Artificial Intelligence · Computer Science 2020-12-22 Angelos Charalambidis , Giorgos Papadimitriou , Panos Rondogiannis , Antonis Troumpoukis

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

Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus. Later a deep inference system BV was developed with…

Logic in Computer Science · Computer Science 2023-06-22 Sergey Slavnov

Logics with analogous semantics, such as Fuzzy Logic, have a number of explanatory and application advantages, the most well-known being the ability to help experts develop control systems. From a cognitive systems perspective, such…

Artificial Intelligence · Computer Science 2022-01-24 Hedda R. Schmidtke , Sara Coelho

This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. Given imprecise information represented by probability bounds and conditional…

Artificial Intelligence · Computer Science 2021-09-28 Haifeng Qian , Radu Marinescu , Alexander Gray , Debarun Bhattacharjya , Francisco Barahona , Tian Gao , Ryan Riegel , Pravinda Sahu

This paper defines a new proof- and category-theoretic framework for classical linear logic that separates reasoning into one linear regime and two persistent regimes corresponding to ! and ?. The resulting linear/producer/consumer (LPC)…

Logic in Computer Science · Computer Science 2015-02-18 Jennifer Paykin , Steve Zdancewic

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus uses labels and transition formulas and can be used to prove decidability and space…

Logic in Computer Science · Computer Science 2007-05-23 Nicola Olivetti , Gian Luca Pozzato , Camilla Schwind

The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard two-valued semantics everything is entailed if knowledge and information is inconsistent.…

Artificial Intelligence · Computer Science 2014-05-01 Wenzhao Qiao , Nico Roos

Our main contributions can be divided in three parts: (1) Fixpoint extensions of first-order logic: we give a precise syntactic and semantic characterization of the relationship between $\mathrm{FO(TC^1)}$ and $\mathrm{FO(LFP)}$; (2)…

Logic in Computer Science · Computer Science 2015-06-30 Facundo Carreiro

The goal of this paper is to establish that it remains undecidable whether a sequent is provable in two systems in which a weakening rule for an exponential modality is completely omitted from classical propositional linear logic…

Logic in Computer Science · Computer Science 2025-09-03 Jun Suzuki , Katsuhiko Sano
‹ Prev 1 3 4 5 6 7 10 Next ›