754 search results - page 115 / 151 » An Ordered Logic Program Solver |
163
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
160
click to vote
NAACL
2007
15 years 6 months ago
2007
Previous work on discourse parsing has mostly relied on surface syntactic and lexical features; the use of semantics is limited to shallow semantics. The goal of this thesis is to...
171
click to vote
WFLP
2009
Springer
15 years 11 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
139
click to vote
TLCA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
114
click to vote
SEMWEB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We introduce a framework, based on logic programming, for preferential reasoning with agents on the Semantic Web. Initially, we encode the knowledge of an agent as a logi...