12 search results - page 2 / 3 » Functional Plus Logic Programming with Built-In and Symbolic... |
TAP
2010
Springer
13 years 3 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
CORR
1998
Springer
13 years 5 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
LOPSTR
2005
Springer
13 years 11 months ago
2005
Springer
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
ICLP
1995
Springer
13 years 9 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...