1598 search results - page 48 / 320 » A Unified Computation Model for Functional and Logic Program... |
141
click to vote
ICLP
2007
Springer
15 years 10 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...
134
click to vote
ICLP
1998
Springer
15 years 8 months ago
1998
Springer
Interpretation Reconciled Michael Leuschel1 Department of Computer Science, K.U. Leuven, Belgium DIKU, University of Copenhagen, Denmark fy the relationship between abstract inter...
164
click to vote
ICLP
1995
Springer
15 years 8 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...
143
click to vote
ICLP
2001
Springer
15 years 9 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
160
click to vote
WISES
2003
15 years 5 months ago
2003
— Ubiquitous computing provides services to users, according to their current situation. Interactions with such programs are as implicit as possible. We find among the applicati...