Discussion Graph Semantics of First-Order Logic with Equality for Reasoning about Discussion and Argumentation
We formulate discussion graph semantics of first-order logic with equality for reasoning about discussion and argumentation as naturally as we would reason about sentences. While there are a few existing proposals to use a formal logic for reasoning about argumentation, they are constructed bottom-up and specialised to the argumentation model by Dung. There is indeed a conspicuous lack of a formal reasoning framework for handling general discussion and argumentation models. We achieve the generality through a top-down formulation of the semantics of first-order logic (with equality) formulas, addressing the current shortage.
Code (0)
등록된 구현이 없습니다.
Tasks
Formal LogicSimilar Papers 제목 키워드 기반
Graph Representations for Higher-Order Logic and Theorem Proving
This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem prove…
Automated Theorem ProvingThe ERA of FOLE: Foundation
This paper discusses the representation of ontologies in the first-order logical environment {\ttfamily FOLE}. An ontology defines the primitives with which to model the knowledge resources for a community of discourse. …
AttributeFormGeneral ClassificationTheorem Proving Based on Semantics of DNA Strand Graph
Because of several technological limitations of traditional silicon based computing, for past few years a paradigm shift, from silicon to carbon, is occurring in computational world. DNA computing has been considered to …
Automated Theorem ProvingFirst-Order Stable Model Semantics and First-Order Loop Formulas
Lin and Zhaos theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully ca…
Description Logics Go Second-Order -- Extending EL with Universally Quantified Concepts
The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful an…