Sciweavers

143 search results - page 17 / 29
» On Some Differences Between Semantics of Logic Program Updat...
Sort
View
POPL
2007
ACM
15 years 10 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
LPKR
1997
Springer
15 years 1 months ago
Reasoning with Prioritized Defaults
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...
Michael Gelfond, Tran Cao Son
ECEASST
2008
121views more  ECEASST 2008»
14 years 9 months ago
Analyzing Semantic Properties of OCL Operations by Uncovering Interoperational Relationships
The OCL (Object Constraint Language) as part of the UML (Unified Modeling Language) is a rich language with different collection kinds (sets, multi-sets, sequences) and a large var...
Mirco Kuhlmann, Martin Gogolla
POPL
2005
ACM
15 years 10 months ago
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
John Field, Carlos A. Varela
ASP
2005
Springer
15 years 3 months ago
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Enrico Giunchiglia, Marco Maratea