Sciweavers

934 search results - page 102 / 187
» Elementary Sets of Logic Programs
Sort
View
ESOP
2005
Springer
15 years 3 months ago
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
Michael Leuschel, Germán Vidal
ACL
2004
14 years 11 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
AAAI
2007
15 years 8 days ago
Generality and Equivalence Relations in Default Logic
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
Katsumi Inoue, Chiaki Sakama
POPL
2009
ACM
15 years 10 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
PODS
2005
ACM
147views Database» more  PODS 2005»
15 years 10 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....