English
Related papers

Related papers: Extensions to Justification Theory

200 papers

We present a logic for the reasoning about necessity and justifications which is independent from relational semantics. We choose the concept of justification -- coming from a class of "Justification Logics" (Artemov 2008, Fitting 2009) --…

Logic in Computer Science · Computer Science 2015-03-20 Steffen Lewitzka

Abstraction logic is a new logic, serving as a foundation of mathematics. It combines features of both predicate logic and higher-order logic: abstraction logic can be viewed both as higher-order logic minus static types as well as…

Logic in Computer Science · Computer Science 2022-07-13 Steven Obua

The use of logical systems for problem-solving may be as diverse as in proving theorems in mathematics or in figuring out how to meet up with a friend. In either case, the problem solving activity is captured by the search for an…

Logic in Computer Science · Computer Science 2023-03-28 Alexander V. Gheorghiu , David J. Pym

Justification logics are an explication of modal logic; boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system e.g. using sequent, hypersequent or nested…

Logic in Computer Science · Computer Science 2025-07-15 Sonia Marin , Paaras Padhiar

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

Axiomatic set theory is almost universally accepted as the basic theory which provides the foundations of mathematics, and in which the whole of present day mathematics can be developed. As such, it is the most natural framework for…

Logic in Computer Science · Computer Science 2012-03-29 Arnon Avron

In this paper we present analytic tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give…

Logic · Mathematics 2016-06-14 Meghdad Ghari

Bayesian networks provide an elegant formalism for representing and reasoning about uncertainty using probability theory. Theyare a probabilistic extension of propositional logic and, hence, inherit some of the limitations of propositional…

Artificial Intelligence · Computer Science 2007-05-23 Kristian Kersting , Luc De Raedt

Cognitive theories for reasoning are about understanding how humans come to conclusions from a set of premises. Starting from hypothetical thoughts, we are interested which are the implications behind basic everyday language and how do we…

Artificial Intelligence · Computer Science 2022-05-11 Emmanuelle Dietz , Johannes K. Fichte , Florim Hamiti

Answer set programming (ASP) is a popular nonmonotonic-logic based paradigm for knowledge representation and solving combinatorial problems. Computing the answer set of an ASP program is NP-hard in general, and researchers have been…

Artificial Intelligence · Computer Science 2021-04-06 Fang Li , Huaduo Wang , Gopal Gupta

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

This paper will develop a single framework for unifying, simplifying and extending our prior results about axiom systems that retain a partial knowledge of their own consistency, via an axiomatic declaration of self-consistency. Its perhaps…

Logic · Mathematics 2012-01-04 Dan E. Willard

Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…

Artificial Intelligence · Computer Science 2018-09-05 Anthony Hunter

Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Description Framework (RDF). One of the primary purposes of a…

Logic in Computer Science · Computer Science 2009-05-13 Marko A. Rodriguez , Joe Geldart

Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy. The de-facto standard infrastructure for automated theorem proving, the TPTP World, currently…

Artificial Intelligence · Computer Science 2022-02-22 Alexander Steen , David Fuenmayor , Tobias Gleißner , Geoff Sutcliffe , Christoph Benzmüller

This paper presents Abduction and Argumentation as two principled forms for reasoning, and fleshes out the fundamental role that they can play within Machine Learning. It reviews the state-of-the-art work over the past few decades on the…

Artificial Intelligence · Computer Science 2020-10-27 Antonis Kakas , Loizos Michael

Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises because the conclusion validly deduced from a set of…

A model of knowledge representation is described in which propositional facts and the relationships among them can be supported by other facts. The set of knowledge which can be supported is called the set of cognitive units, each having…

Artificial Intelligence · Computer Science 2013-04-12 A. Julian Craddock , Roger A. Browse

Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…

Logic in Computer Science · Computer Science 2026-05-20 Sophia Roshal , Frank Pfenning

Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Meanings are often assumed to combine…

cmp-lg · Computer Science 2008-02-03 Mary Dalrymple , John Lamping , Fernando Pereira , Vijay Saraswat