4370 search results - page 388 / 874 » Algebra of Logic Programming |
111
Voted
FSTTCS
1993
Springer
15 years 7 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
117
click to vote
APSEC
2003
IEEE
15 years 7 months ago
2003
IEEE
Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but ...
116
click to vote
AML
2006
15 years 3 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
131
Voted
RWEB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Answer Set Programming (ASP) is a declarative problem solving paradigm, rooted in Logic Programming and Nonmonotonic Reasoning, which has been gaining increasing attentio...
130
click to vote
CP
2000
Springer
15 years 7 months ago
2000
Springer
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...