764 search results - page 29 / 153 » On the Expressibility of Stable Logic Programming |
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
ECSQARU
1997
Springer
14 years 7 days ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
ESWS
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
ACL
2008
13 years 9 months ago
2008
The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present ...
CTCS
1989
Springer
14 years 4 days ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...