SLDNF-resolution with equality

Shepherdson, J. C.

doi:10.1007/bf00244285

Cited by 14 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the adequate computation mechanism is SLDENF-resolution, i.e. SLD-resolution augmented by negation-as-failure along with an extended unification procedure which unifies wrt a concrete equational theory [30,17,32]. Moreover, we sometimes employ constructive negation [5] to avoid the problem of floundering.…”

Section: The Equational Logic Programming Approachmentioning

confidence: 99%

“…Moreover, we sometimes employ constructive negation [5] to avoid the problem of floundering. Semantics is defined by K. Clark's completion [6] along with a so-called unification complete theory AC1 * which allows to derive inequality of two terms whenever they are not unifiable [18,30,17]. Let (P * A , AC1 * ) denote the completion of our program depicted in Figure 1.…”

Section: The Equational Logic Programming Approachmentioning

confidence: 99%

See 1 more Smart Citation

Representing Actions in Equational Logic Programming

Thielscher¹

1994

Logic Programming

View full text Add to dashboard Cite

A sound and complete approach for encoding the action description language A developed by M. Gelfond and V. Lifschitz in an equational logic program is given. Our results allow the comparison of the resource-oriented equational logic based approach and various other methods designed for reasoning about actions, most of them based on variants of the situation calculus, which were also related to the action description language recently. A non-trivial extension of A is proposed which allows to handle uncertainty in form of non-deterministic action descriptions, i.e. where actions may have alternative randomized effects. It is described how the equational logic programming approach forms a sound and complete encoding of this extended action description language A ND as well.

show abstract

Section: The Equational Logic Programming Approachmentioning

confidence: 99%