English
Related papers

Related papers: Propositional Abduction via Only-Knowing: A Non-Mo…

200 papers

In this paper an approach to automated deduction under uncertainty,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a lower bound of a necessity or a possibility measure,…

Artificial Intelligence · Computer Science 2013-04-08 Didier Dubois , Jerome Lang , Henri Prade

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…

Logic in Computer Science · Computer Science 2015-09-07 Daniele Porello , Nicolas Troquard

Common knowledge and only knowing capture two intuitive and natural notions that have proven to be useful in a variety of settings, for example to reason about coordination or agreement between agents, or to analyse the knowledge of…

Logic in Computer Science · Computer Science 2023-06-07 Marcos Cramer , Samuele Pollaci , Bart Bogaerts

An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such…

Artificial Intelligence · Computer Science 2013-04-11 Norman C. Dalkey

Deductive and abductive reasoning are two critical paradigms for analyzing knowledge graphs, enabling applications from financial query answering to scientific discovery. Deductive reasoning on knowledge graphs usually involves retrieving…

Artificial Intelligence · Computer Science 2026-02-12 Yisen Gao , Jiaxin Bai , Yi Huang , Xingcheng Fu , Qingyun Sun , Yangqiu Song

In the last 20 years many proposals have been made to incorporate non-monotonic reasoning into description logics, ranging from approaches based on default logic and circumscription to those based on preferential semantics. In particular,…

Artificial Intelligence · Computer Science 2014-04-29 Oliver Fernández Gil

An approach to induction is presented, based on the idea of analysing the context of a given problem into `circumstances'. This approach, fully Bayesian in form and meaning, provides a complement or in some cases an alternative to that…

Data Analysis, Statistics and Probability · Physics 2007-05-23 P. G. L. Porta Mana , A. Månsson , G. Björk

This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…

Logic in Computer Science · Computer Science 2021-01-11 Carlos Olarte , Elaine Pimentel , Camilo Rocha

Time series interpretation aims to provide an explanation of what is observed in terms of its underlying processes. The present work is based on the assumption that the common classification-based approaches to time series interpretation…

Artificial Intelligence · Computer Science 2021-12-09 Tomás Teijeiro , Paulo Félix

The tension between deduction and induction is perhaps the most fundamental issue in areas such as philosophy, cognition and artificial intelligence. In an influential paper, Valiant recognised that the challenge of learning should be…

Artificial Intelligence · Computer Science 2023-06-12 Ionela G. Mocanu , Vaishak Belle , Brendan Juba

We propose a new modal logic endowed with a simple deductive system to interpret Aristotle's theory of the modal syllogism. While being inspired by standard propositional modal logic it is also a logic of terms that admits a (sound)…

Logic · Mathematics 2022-06-15 Clarence Protin

We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…

Logic in Computer Science · Computer Science 2023-10-20 Alexander V. Gheorghiu , David J. Pym

We start by defining an approach to non-monotonic probabilistic reasoning in terms of non-monotonic categorical (true-false) reasoning. We identify a type of non-monotonic probabilistic reasoning, akin to default inheritance, that is…

Artificial Intelligence · Computer Science 2013-04-12 Benjamin N. Grosof

Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study {\em abduction with penalization} in logic programming. This…

Logic in Computer Science · Computer Science 2007-05-23 Giovambattista Ianni , Nicola Leone , Simona Perri , Francesco Scarcello

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

Artificial Intelligence · Computer Science 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

Over two decades ago a "quite revolution" overwhelmingly replaced knowledgebased approaches in natural language processing (NLP) by quantitative (e.g., statistical, corpus-based, machine learning) methods. Although it is our firm belief…

Artificial Intelligence · Computer Science 2008-08-11 Walid S. Saba

In this paper we explore a unifying approach --- that of hypotheses assumption --- as a means to provide a semantics for all Normal Logic Programs (NLPs), the Minimal Hypotheses (MH) semantics. This semantics takes a positive hypotheses…

Logic in Computer Science · Computer Science 2011-08-31 Alexandre Miguel Pinto , Luś Moniz Pereira

In this paper, we present an alternative interpretation of propositional inquisitive logic as an epistemic logic of knowing how. In our setting, an inquisitive logic formula $\alpha$ being supported by a state is formalized as "knowing how…

Logic · Mathematics 2022-06-06 Haoyu Wang , Yanjing Wang , Yunsong Wang

Probability theory, epistemically interpreted, provides an excellent, if not the best available account of inductive reasoning. This is so because there are general and definite rules for the change of subjective probabilities through…

Artificial Intelligence · Computer Science 2013-04-10 Wolfgang Spohn

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›