1017 search results - page 75 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
PPDP
2007
Springer
15 years 3 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
ICLP
2003
Springer
15 years 2 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
SCP
2010
14 years 8 months ago
2010
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specifica...
RULEML
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we argue that a realistic architecture for the Semantic Web must be based on multiple independent, but interoperable, stacks of languages. In particular, we argue tha...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...