2022 search results - page 238 / 405 » Complexity of Non-Monotonic Logics |
176
click to vote
DAGSTUHL
2003
15 years 7 months ago
2003
Abstract. In this paper, we show how the concepts of objects, components, features and agents are used today in the Agent Building Center (ABC) environment in order to marry the mo...
216
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
166
click to vote
ICAI
2004
15 years 7 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
255
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
300
click to vote
LCC
1994
15 years 10 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...