Sciweavers

4126 search results - page 114 / 826
» Set based logic programming
Sort
View
AIMSA
2000
Springer
15 years 2 months ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva
CSL
2010
Springer
14 years 11 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
ICLP
1993
Springer
15 years 2 months ago
Control Generation for Logic Programs
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
Stefan Lüttringhaus-Kappel
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 10 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
ASP
2003
Springer
15 years 3 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...