387 search results - page 14 / 78 » Hyperequivalence of Logic Programs with Respect to Supported... |
TLDI
2009
ACM
14 years 4 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...
ILP
2000
Springer
13 years 11 months ago
2000
Springer
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
AAMAS
2011
Springer
12 years 11 months ago
2011
Springer
This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic pro...
EUROPAR
2000
Springer
13 years 11 months ago
2000
Springer
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...