Sciweavers

1313 search results - page 140 / 263
» Prioritized Reasoning in Logic Programming
Sort
View
LPNMR
2004
Springer
15 years 3 months ago
Using Criticalities as a Heuristic for Answer Set Programming
Abstract. Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic program...
Orkunt Sabuncu, Ferda Nur Alpaslan, Varol Akman
ICALP
2000
Springer
15 years 1 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
ESWS
2010
Springer
15 years 1 months ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani
LICS
1994
IEEE
15 years 2 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
15 years 6 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...