Reasoning about the Intentions of Agents

Blount, Justin; Gelfond, Michael

doi:10.1007/978-3-642-29414-3_9

Cited by 4 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CRModels2 [7] is the state of the art solver for CR-prolog programs. To compare the performance of the DLV based solver to CRModels2, we use the classical benchmark of the reaction control system for the space shuttle [3] and new benchmarks such as representing and reasoning with intentions [5], and the shortest path problem.…”

Section: Resultsmentioning

confidence: 99%

“…We compare crTranslator with CRModels2 on the following scenarios proposed in [5]: Consider a row of four rooms, r 1 , r 2 , r 3 , r 4 connected by doorways, such that an agent may move along the row from one room to the next. We say that two people meet if they are located in the same room.…”

Section: The First Benchmark: Programs For Representing and Reasoning...mentioning

confidence: 99%

“…Assuming that as Bob is moving from r 1 to r 2 , John moves from r 3 to r 2 , the second task is to recognize the unexpected achievement of his goal and not continue moving to r 3 . Programs to implement these two tasks are given as B 0 and B 1 respectively in [5]. In this experiment, crTranslator has a clear advantage over CR-Models2 on task 1 and similar performance on task 2.…”

Section: The First Benchmark: Programs For Representing and Reasoning...mentioning

confidence: 99%

“…In particular we concentrate on the extension of ASP called CR-Prolog -Answer Set Prolog with consistency restoring rules (CR-rules for short) [2]. The language, which allows a comparatively simple encoding of indirect exceptions to defaults, has been successfully used for a number of applications including planning [3], probabilistic reasoning [4], and reasoning about intentions [5]. This paper is a preliminary report on our attempts to make CR-Prolog (and hence other dialects of ASP) more user friendly and more suitable for use in teaching and large applications.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

SPARC - Sorted ASP with Consistency Restoring Rules

Balai,

Gelfond,

Zhang

2013

Preprint

Self Cite

View full text Add to dashboard Cite

This is a preliminary report on the work aimed at making CR-Prologa version of ASP with consistency restoring rules -more suitable for use in teaching and large applications. First we describe a sorted version of CR-Prolog called SPARC. Second, we translate a basic version of the CR-Prolog into the language of DLV and compare the performance with the state of the art CR-Prolog solver. The results form the foundation for future more efficient and user friendly implementation of SPARC and shed some light on the relationship between two useful knowledge representation constructs: consistency restoring rules and weak constraints of DLV.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: The First Benchmark: Programs For Representing and Reasoning...mentioning

confidence: 99%

Section: The First Benchmark: Programs For Representing and Reasoning...mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

SPARC - Sorted ASP with Consistency Restoring Rules

Balai,

Gelfond,

Zhang

2013

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…There are extensive amount of research in the literature on reasoning about mental states of agents such as beliefs, desires and intentions. This line of research is especially about the relationship between an agent's intention and his future actions and plans (Baral & Gelfond, 2005;Blount & Gelfond, 2012;Cohen & Levesque, 1990;Lorini & Herzig, 2008;Rao & Georgeff, 1991;Wooldridge, 2002). However in attempted crime we are only concerned about intention of past actions of the defendant as we have studied in this paper.…”

Section: Evidential Reasoningmentioning

confidence: 99%

Modelling last-act attempted crime in criminal law

Pooksook

Dung

Satoh

et al. 2019

Journal of Applied Non-Classical Logics

View full text Add to dashboard Cite

In the court of law, a person can be punished for attempting to commit a crime. An open issue in the study of Artificial Intelligence and Law is whether the law of attempts could be formally modelled. There are distinct legal rules for determining attempted crime whereas the last-act rule (also called proximity rule) represents the strictest approach. In this paper we provide a formal model of the last-act rule using structured argumentation.

show abstract