Sciweavers

314 search results - page 27 / 63
» Compactness Properties for Stable Semantics of Logic Program...
Sort
View
88
Voted
NJC
2002
109views more  NJC 2002»
14 years 9 months ago
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
Mogens Nielsen, Catuscia Palamidessi, Frank D. Val...
VMCAI
2009
Springer
15 years 4 months ago
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
Hasan Amjad, Richard Bornat
ENTCS
2006
118views more  ENTCS 2006»
14 years 9 months ago
An Operational Domain-theoretic Treatment of Recursive Types
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
Weng Kin Ho
LPNMR
2007
Springer
15 years 3 months ago
A Preference-Based Framework for Updating Logic Programs
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
James P. Delgrande, Torsten Schaub, Hans Tompits
ILP
2000
Springer
15 years 1 months ago
Bayesian Logic Programs
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
Kristian Kersting, Luc De Raedt