1020 search results - page 123 / 204 » Tight Semantics for Logic Programs |
107
click to vote
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
SEMWEB
2005
Springer
15 years 5 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...
100
click to vote
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
125
click to vote
AAMAS
2011
Springer
14 years 7 months ago
2011
Springer
We present a family of sound and complete logics for reasoning about deliberation strategies for SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL...
135
click to vote
ICLP
2011
Springer
14 years 3 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...