4370 search results - page 409 / 874 » Algebra of Logic Programming |
117
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
123
Voted
FMCO
2003
Springer
15 years 8 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
111
click to vote
LICS
1989
IEEE
15 years 7 months ago
1989
IEEE
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the...
156
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
127
Voted
FOSSACS
2010
Springer
15 years 10 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...