Sciweavers

ICLP
2009
Springer
13 years 10 months ago
Proving Termination by Invariance Relations
Paolo Pilozzi, Danny De Schreye
ICLP
2009
Springer
13 years 10 months ago
Automating Termination Proofs for CHR
Paolo Pilozzi, Danny De Schreye
ICLP
2009
Springer
14 years 4 months ago
Integration of Abductive Reasoning and Constraint Optimization in SCIFF
Abstract. Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP co...
Marco Gavanelli, Marco Alberti, Evelina Lamma
ICLP
2009
Springer
14 years 7 months ago
An Engine for Computing Well-Founded Models
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
Terrance Swift
ICLP
2009
Springer
14 years 7 months ago
Stabilization of Information Sharing for Queries Answering in Multiagent Systems
We consider multiagent systems situated in unpredictable environments. Agents viewed as abductive logic programs with abducibles being literals the agent could sense or receive fro...
Phan Minh Dung, Do Duc Hanh, Phan Minh Thang
ICLP
2009
Springer
14 years 7 months ago
An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems
Abstract. The FORCES project aims at providing robust and declarative formalisms for analyzing systems in the emerging areas of Security Protocols, Biological Systems and Multimedi...
Jesús Aranda, Gérard Assayag, Carlos...
ICLP
2009
Springer
15 years 25 days ago
Integrating Software Testing and Run-Time Checking in an Assertion Verification Framework
Abstract. We present a framework that unifies unit testing and runtime verification (as well as static verification and static debugging). A key contribution of our overall approac...
Edison Mera, Manuel V. Hermenegildo, Pedro L&oacut...
ICLP
2009
Springer
15 years 25 days ago
A Language for Large Ensembles of Independently Executing Nodes
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
Michael P. Ashley-Rollman, Peter Lee, Seth Copen G...
ICLP
2009
Springer
15 years 25 days ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz