2236 search results - page 170 / 448 » Language Independence and Language Tolerance in Logic Progra... |
177
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
253
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
183
click to vote
ESOP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
171
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
137
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...