A Logical Characterization of Evaluable Knowledge Bases

Alexander Sakharov

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

A Logical Characterization of Evaluable Knowledge Bases

Topics: Knowledge Representation and Reasoning; Knowledge-Based Systems

In Proceedings of the 14th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART, 681-688, 2022

Author: Alexander Sakharov

Affiliation: Synstretch, Framingham, MA, U.S.A.

Keyword(s): Evaluable Function/predicate, Reductio Ad Absurdum, 3-Valued Model, Substructural Sequent Calculus.

Abstract: Evaluable knowledge bases are comprised of non-Horn rules with partial predicates and functions, some of them are defined as recursive functions. This paper investigates logical foundations of the derivation of literals from evaluable knowledge bases without reasoning by contradiction. The semantics of this inference is specified by constrained 3-valued models. The derivation of literals without reasoning by contradiction is characterized by means of sequent calculi with non-logical axioms expressing knowledge base rules and facts. The logical rules of these calculi include only the negation rules, and cut is the only essential structural rule.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.119.213.225

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Sakharov, A. (2022). A Logical Characterization of Evaluable Knowledge Bases. In Proceedings of the 14th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART; ISBN 978-989-758-547-0; ISSN 2184-433X, SciTePress, pages 681-688. DOI: 10.5220/0010886700003116

@conference{icaart22,
author={Alexander Sakharov},
title={A Logical Characterization of Evaluable Knowledge Bases},
booktitle={Proceedings of the 14th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART},
year={2022},
pages={681-688},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010886700003116},
isbn={978-989-758-547-0},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 14th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART
TI - A Logical Characterization of Evaluable Knowledge Bases
SN - 978-989-758-547-0
IS - 2184-433X
AU - Sakharov, A.
PY - 2022
SP - 681
EP - 688
DO - 10.5220/0010886700003116
PB - SciTePress