2084 search results - page 64 / 417 » Set Constraints in Logic Programming |
POPL
1995
ACM
13 years 11 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
PLDI
1997
ACM
14 years 6 days ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
ICCS
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
NMR
2004
Springer
14 years 1 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...