Sciweavers

3481 search results - page 46 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
14 years 2 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
ICLP
2009
Springer
14 years 9 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
ENTCS
2006
189views more  ENTCS 2006»
13 years 8 months ago
Variables as Resource for Shared-Memory Programs: Semantics and Soundness
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
Stephen D. Brookes
LOPSTR
1997
Springer
14 years 29 days ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
ICLP
2005
Springer
14 years 2 months ago
Coordination of Many Agents
This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framewo...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu