4513 search results - page 611 / 903 » Logic programming with satisfiability |
163
click to vote
WFLP
2009
Springer
15 years 10 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...
133
click to vote
TLCA
2009
Springer
15 years 10 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...
110
click to vote
SEMWEB
2005
Springer
15 years 9 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...
126
click to vote
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
163
click to vote
NMR
2004
Springer
15 years 9 months ago
2004
Springer
The BDI model provides what it is possibly one of the most promising architectures for the development of intelligent agents, and has become one of the most studied and well known...