1097 search results - page 75 / 220 » Revision Programming = Logic Programming Integrity Constra... |
114
Voted
JLP
1998
15 years 3 months ago
1998
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...
156
click to vote
ACL
1997
15 years 4 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
102
click to vote
ESWS
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
111
Voted
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
123
click to vote
ICLP
2004
Springer
15 years 8 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...