Sciweavers

97 search results - page 3 / 20
» A Generalized Gelfond-Lifschitz Transformation for Logic Pro...
Sort
View
LICS
2007
IEEE
14 years 1 months ago
Local Action and Abstract Separation Logic
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
Cristiano Calcagno, Peter W. O'Hearn, Hongseok Yan...
UAI
2003
13 years 8 months ago
CLP(BN): Constraint Logic Programming for Probabilistic Knowledge
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
Vítor Santos Costa, David Page, Maleeha Qaz...
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 21 days ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
TOOLS
2008
IEEE
14 years 1 months ago
Guarded Program Transformations Using JTL
There is a growing research interest in employing the logic paradigm for making queries on software in general, and OOP software in particular. We describes a side-effect-free tech...
Tal Cohen, Joseph Gil, Itay Maman
LPNMR
2009
Springer
14 years 1 months ago
A Default Approach to Semantics of Logic Programs with Constraint Atoms
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
Yi-Dong Shen, Jia-Huai You