Sciweavers

192 search results - page 23 / 39
» Logic Programs with Abstract Constraint Atoms
Sort
View
ECAI
2008
Springer
13 years 10 months ago
Advanced Preprocessing for Answer Set Solving
Abstract. We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences ...
Martin Gebser, Benjamin Kaufmann, André Neu...
ADC
1999
Springer
97views Database» more  ADC 1999»
14 years 23 days ago
Pseudo-Naive Evaluation
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...
Donald A. Smith, Mark Utting
COSIT
2011
Springer
322views GIS» more  COSIT 2011»
12 years 8 months ago
CLP(QS): A Declarative Spatial Reasoning Framework
Abstract. We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We sy...
Mehul Bhatt, Jae Hee Lee, Carl Schultz
IEEESCC
2005
IEEE
14 years 2 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 8 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...