中文
相关论文

相关论文: Stit logic of justification announcements: a compl…

200 篇论文

We consider the explicit fragment of the basic justification stit logic introduced in earlier publications. We define a Hilbert-style axiomatic system for this logic and show that this system is strongly complete relative to the intended…

逻辑 · 数学 2017-09-21 Grigory K. Olkhovikov

In Part I of this paper, we presented a Hilbert-style system $\Sigma_D$ axiomatizing of stit logic of justification announcements (JA-STIT) interpreted over models with discrete time structure. In this part, we prove three frame…

逻辑 · 数学 2017-08-22 Grigory K. Olkhovikov

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…

逻辑 · 数学 2017-05-26 Grigory K. Olkhovikov

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a…

计算机科学中的逻辑 · 计算机科学 2023-08-01 Samuel Bucheli , Roman Kuznets , Thomas Studer

Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order.…

计算机科学中的逻辑 · 计算机科学 2017-03-08 Katsuhiko Sano , John G. Stell

We formulate a Hilbert-style axiomatic system for STIT logic of imagination recently proposed by H. Wansing and prove its completeness by the method of canonical models.

逻辑 · 数学 2015-04-13 Grigory K. Olkhovikov

Justification Logics provide a framework for reasoning about justifications and evidences. Most of the accounts of justification logics are crisp in the sense that agent's justifications for a statement is convincing or is not. In this…

逻辑 · 数学 2025-01-17 Meghdad Ghari

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit…

计算机科学中的逻辑 · 计算机科学 2015-10-27 Samuel Bucheli

We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…

逻辑 · 数学 2020-08-18 Nicholas Pischke

Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential. Nested justification systems, first introduced by Denecker et al. (2015), allow for the composition…

人工智能 · 计算机科学 2022-05-11 Simon Marynissen , Jesse Heyninck , Bart Bogaerts , Marc Denecker

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit…

计算机科学中的逻辑 · 计算机科学 2017-03-08 Samuel Bucheli , Meghdad Ghari , Thomas Studer

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between…

多智能体系统 · 计算机科学 2011-04-29 Nicolas Troquard , Wiebe van der Hoek , Michael Wooldridge

We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…

逻辑 · 数学 2009-09-25 Josef Schoenbrunner

Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…

计算机科学中的逻辑 · 计算机科学 2019-05-16 Simon Marynissen

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…

逻辑 · 数学 2016-06-14 Meghdad Ghari

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…

cmp-lg · 计算机科学 2008-02-03 Suresh Manandhar

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…

人工智能 · 计算机科学 2013-04-11 Norman C. Dalkey

This paper provides a set of cut-free complete sequent-style calculi for deontic STIT ('See To It That') logics used to formally reason about choice-making, obligations, and norms in a multi-agent setting. We leverage these calculi to write…

计算机科学中的逻辑 · 计算机科学 2024-10-07 Tim S. Lyon , Kees van Berkel

In the interaction between agents we can have an explicative discourse, when communicating preferences or intentions, and a normative discourse, when considering normative knowledge. For justifying their actions our agents are endowed with…

人工智能 · 计算机科学 2013-04-16 Ioan Alfred Letia , Adrian Groza

In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…

逻辑 · 数学 2023-08-21 Michael Baur , Thomas Studer
‹ 上一页 1 2 3 10 下一页 ›