8232 search results - page 132 / 1647 » Dynamic Logic Programming |
202
Voted
ICLP
2003
Springer
15 years 10 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
117
Voted
LPNMR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
152
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
142
Voted
PPDP
2001
Springer
15 years 9 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
135
Voted
ICALP
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.