643 search results - page 34 / 129 » Semantic Determinism and Functional Logic Program Properties |
113
Voted
TPLP
2002
15 years 1 months ago
2002
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
111
Voted
LPNMR
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
146
click to vote
AGP
2003
IEEE
15 years 7 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
120
click to vote
ICLP
2007
Springer
15 years 8 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...
ICFP
1998
ACM
15 years 6 months ago
1998
ACM
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...