Sciweavers

9 search results - page 1 / 2
» tplp 2008
Sort
View
TPLP
2002
90views more  TPLP 2002»
13 years 3 months ago
Properties of input-consuming derivations
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
TPLP
2008
118views more  TPLP 2008»
13 years 3 months ago
Logic programming with satisfiability
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming f...
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
TPLP
2002
69views more  TPLP 2002»
13 years 3 months ago
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
TPLP
2010
102views more  TPLP 2010»
13 years 2 months ago
As time goes by: Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
Jon Sneyers, Peter Van Weert, Tom Schrijvers, Lesl...
TPLP
2010
135views more  TPLP 2010»
13 years 2 months ago
Formalization of psychological knowledge in answer set programming and its application
In this paper we explore the use of Answer Set Programming (ASP) to formalize, and reason about, psychological knowledge. In the field of psychology, a considerable amount of kno...
Marcello Balduccini, Sara Girotto