English
Related papers

Related papers: Sub-sub-intuitionistic logic

200 papers

In a standard possibilistic logic, prioritized information are encoded by means of weighted knowledge base. This paper proposes an extension of possibilistic logic for dealing with partially ordered information. We Show that all basic…

Artificial Intelligence · Computer Science 2012-12-12 Salem Benferhat , Sylvain Lagrue , Odile Papini

Humans currently use arguments for explaining choices which are already made, or for evaluating potential choices. Each potential choice has usually pros and cons of various strengths. In spite of the usefulness of arguments in a decision…

Artificial Intelligence · Computer Science 2012-07-19 Leila Amgoud , Henri Prade

Counting propositional logic was recently introduced in relation to randomized computation and shown able to logically characterize the full counting hierarchy. In this paper we aim to clarify the intuitive meaning and expressive power of…

Logic in Computer Science · Computer Science 2022-11-17 Melissa Antonelli

In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…

Logic · Mathematics 2025-10-03 Daniel Rogozin

We present the intuitionistic version of PUC-Logic. After that, we present a constructive approach to Lewis' counterfactual abstraction to show that it does not require the classical absurd rule.

Logic in Computer Science · Computer Science 2014-05-22 Ricardo Q. A. Fernandes , Edward H. Haeusler , Luiz Carlos Pereira

Separation logic is a concise method for specifying programs that manipulate dynamically allocated storage. Partially inspired by separation logic, Implicit Dynamic Frames has recently been proposed, aiming at first-order tool support. In…

Programming Languages · Computer Science 2015-07-01 Matthew J. Parkinson , Alexander J. Summers

It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…

Logic · Mathematics 2021-08-24 Ivan Chajda , Helmut Länger

In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…

Artificial Intelligence · Computer Science 2024-12-16 Nico Roos

We present a doctrinal approach to category theory, obtained by abstracting from the indexed inclusions (via discrete fibrations and opfibrations) of the left and of the right actions of X in Cat in categories over X. Namely, a "weak…

Category Theory · Mathematics 2010-03-30 Claudio Pisani

Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only…

Logic in Computer Science · Computer Science 2021-02-16 Guido Governatori , Michael J. Maher

In this paper we deal with a new approach to probabilistic reasoning in a logical framework. Nearly almost all logics of probability that have been proposed in the literature are based on classical two-valued logic. After making clear the…

Artificial Intelligence · Computer Science 2013-02-21 Petr Hajek , Lluis Godo , Francesc Esteva

We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not…

Artificial Intelligence · Computer Science 2019-01-21 Ryuta Arisaka , Stefano Bistarelli , Francesco Santini

For a computational system to be intelligent, it should be able to perform, at least, basic deductions. Nonetheless, since deductions are, in some sense, equivalent to tautologies, it seems that they do not provide new information. The…

Logic in Computer Science · Computer Science 2014-04-21 Anderson de Araújo

We introduce a logic for reasoning about evidence, that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after making the observation). We provide a sound and complete…

Artificial Intelligence · Computer Science 2014-07-29 Joseph Y. Halpern , Riccardo Pucella

We design a proof system for propositional classical logic that integrates two languages for Boolean functions: standard conjunction-disjunction-negation and binary decision trees. We give two reasons to do so. The first is…

Logic in Computer Science · Computer Science 2022-07-01 Chris Barrett , Alessio Guglielmi

This paper investigates the possibility of performing automated reasoning in probabilistic logic when probabilities are expressed by means of linguistic quantifiers. Each linguistic term is expressed as a prescribed interval of proportions.…

Artificial Intelligence · Computer Science 2013-03-25 Didier Dubois , Henri Prade , Lluis Godo , Ramon Lopez de Mantaras

Probability theory as extended logic is completed such that essentially any probability may be determined. This is done by considering propositional logic (as opposed to predicate logic) as syntactically suffcient and imposing a symmetry…

Statistics Theory · Mathematics 2014-08-12 Cael L. Hasse

Abductive forgetting is removing variables from a logical formula while maintaining its abductive explanations. It is carried in two alternative ways depending on its intended application. Both differ from the usual forgetting, which…

Logic in Computer Science · Computer Science 2025-07-22 Paolo Liberatore

Stereotypical reasoning assumes that the situation at hand is one of a kind and that it enjoys the properties generally associated with that kind of situation. It is one of the most basic forms of nonmonotonic reasoning. A formal model for…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

We consider the problem of answering queries about formulas of propositional logic based on background knowledge partially represented explicitly as other formulas, and partially represented as partially obscured examples independently…

Artificial Intelligence · Computer Science 2012-09-04 Brendan Juba