The language of epistemic specifications (refined) including a prototype solver

Patrick Kahl; Richard Watson; Evgenii Balai; Michael Gelfond; Yuanlin Zhang

doi:10.1093/logcom/exv065

The language of epistemic specifications (refined) including a prototype solver

Patrick Kahl, Richard Watson, Evgenii Balai, Michael Gelfond, Yuanlin Zhang

Computer Science

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing solutions of programs written in this new version of the language. The new semantics is illustrated by a number of examples, including an Epistemic Specifications-based framework for conformant planning. In addition, we introduce the notion of an epistemic logic program with sorts. This extends recent efforts to define a logic programming language that includes the means for explicitly specifying the domains of predicate parameters. An algorithm and its implementation as a solver for epistemic logic programs with sorts is also discussed.

Original language	English
Pages (from-to)	953-989
Number of pages	37
Journal	Journal of Logic and Computation
Volume	30
Issue number	4
DOIs	https://doi.org/10.1093/logcom/exv065
State	Published - Jun 5 2020

Keywords

Epistemic specifications
answer set programming extensions
conformant planning
epistemic logic programs
introspective reasoning
knowledge representation
logic programming
non-monotonic reasoning
rule safety
sorted signature

Access to Document

10.1093/logcom/exv065

Cite this

@article{95648a46857a4dc7bdc4e7aae0fa1cb6,

title = "The language of epistemic specifications (refined) including a prototype solver",

abstract = "In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing solutions of programs written in this new version of the language. The new semantics is illustrated by a number of examples, including an Epistemic Specifications-based framework for conformant planning. In addition, we introduce the notion of an epistemic logic program with sorts. This extends recent efforts to define a logic programming language that includes the means for explicitly specifying the domains of predicate parameters. An algorithm and its implementation as a solver for epistemic logic programs with sorts is also discussed.",

keywords = "Epistemic specifications, answer set programming extensions, conformant planning, epistemic logic programs, introspective reasoning, knowledge representation, logic programming, non-monotonic reasoning, rule safety, sorted signature",

author = "Patrick Kahl and Richard Watson and Evgenii Balai and Michael Gelfond and Yuanlin Zhang",

note = "Publisher Copyright: {\textcopyright} 2015 The Author. Published by Oxford University Press.",

year = "2020",

month = jun,

day = "5",

doi = "10.1093/logcom/exv065",

language = "English",

volume = "30",

pages = "953--989",

journal = "Journal of Logic and Computation",

issn = "0955-792X",

number = "4",

}

TY - JOUR

T1 - The language of epistemic specifications (refined) including a prototype solver

AU - Kahl, Patrick

AU - Watson, Richard

AU - Balai, Evgenii

AU - Gelfond, Michael

AU - Zhang, Yuanlin

PY - 2020/6/5

Y1 - 2020/6/5

N2 - In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing solutions of programs written in this new version of the language. The new semantics is illustrated by a number of examples, including an Epistemic Specifications-based framework for conformant planning. In addition, we introduce the notion of an epistemic logic program with sorts. This extends recent efforts to define a logic programming language that includes the means for explicitly specifying the domains of predicate parameters. An algorithm and its implementation as a solver for epistemic logic programs with sorts is also discussed.

AB - In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing solutions of programs written in this new version of the language. The new semantics is illustrated by a number of examples, including an Epistemic Specifications-based framework for conformant planning. In addition, we introduce the notion of an epistemic logic program with sorts. This extends recent efforts to define a logic programming language that includes the means for explicitly specifying the domains of predicate parameters. An algorithm and its implementation as a solver for epistemic logic programs with sorts is also discussed.

KW - Epistemic specifications

KW - answer set programming extensions

KW - conformant planning

KW - epistemic logic programs

KW - introspective reasoning

KW - knowledge representation

KW - logic programming

KW - non-monotonic reasoning

KW - rule safety

KW - sorted signature

UR - http://www.scopus.com/inward/record.url?scp=85093950045&partnerID=8YFLogxK

U2 - 10.1093/logcom/exv065

DO - 10.1093/logcom/exv065

M3 - Article

AN - SCOPUS:85093950045

SN - 0955-792X

VL - 30

SP - 953

EP - 989

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

IS - 4

ER -

The language of epistemic specifications (refined) including a prototype solver

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this