Titlebook: Logic Programming and Nonmonotonic Reasoning; Third International V. Wiktor Marek,Anil Nerode,M. Truszczyński Conference proceedings 1995

職業(yè)

好開(kāi)玩笑

免除責(zé)任

nugatory

inhibit

沒(méi)花的是打擾

A terminological interpretation of (abductive) logic programming,and use classical logic as the language for the ABox. The resulting logic can be seen as an alternative interpretation of abductive logic program formalism. We study the expressivity of the formalism for representing uncertainty by proposing solutions for problems in temporal reasoning, with null values and open domain knowledge.

Incommensurate

Revision by communication,s, adds the information they can infer to the program and tries to find an acceptable model for the expanded program. In this paper we will concentrate on the kind of information needed to find successful revisions of programs. We point out some parameters along which our framework can be analyzed and suggest some further research.

linear

Skeptical rational extensions,is closed under intersection. In the case of normal default theories our logic coincides with the standard skeptical reasoning with extensions. In the case of seminormal default theories our formalism provides a description of the standard skeptical reasoning with rational extensions.

沉默

rectum

Computing the well-founded semantics faster,rove the . performance of the computation. For a logic program . in atoms .., the speed up over the straight Van Gelder alternating fixed point algorithm (assuming worst-case behavior for both algorithms) is approximately (|.|/|.|).. For |.|≥|.|., the algorithm runs in time linear in |.|.