3424 search results - page 332 / 685 » Automated Testing of Classes |
163
click to vote
CSL
2001
Springer
15 years 11 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
169
click to vote
ECSQARU
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of default conclusions for a given default theory. Reasoning about such exte...
181
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
176
click to vote
LOPSTR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
187
click to vote
LPNMR
2001
Springer
15 years 11 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...