45 search results - page 9 / 9 » Elimination of Self-Resolving Clauses |
CORR
1998
Springer
13 years 7 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
ALT
1995
Springer
13 years 11 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
TREC
2000
13 years 9 months ago
2000
CL Research's question-answering system (DIMAP-QA) for TREC-9 significantly extends its semantic relation triple (logical form) technology in which documents are fully parsed...
AI
2004
Springer
13 years 7 months ago
2004
Springer
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...