Sciweavers

1020 search results - page 140 / 204
» Tight Semantics for Logic Programs
Sort
View
ICFP
2010
ACM
15 years 10 hour ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
ILP
2003
Springer
15 years 5 months ago
Hybrid Abductive Inductive Learning: A Generalisation of Progol
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
Oliver Ray, Krysia Broda, Alessandra Russo
LPKR
1997
Springer
15 years 4 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
PODS
2005
ACM
147views Database» more  PODS 2005»
15 years 12 months ago
Peer data exchange
Abstract. We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supp...
Ariel Fuxman, Phokion G. Kolaitis, Renée J....
VISSOFT
2005
IEEE
15 years 5 months ago
Multi-level Method Understanding Using Microprints
Understanding classes and methods is a key activity in object-oriented programming, since classes represent the abstractions from which applications are built, while methods conta...
Stéphane Ducasse, Michele Lanza, Romain Rob...