Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
PARLOG: parallel programming in logic
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Relational queries computable in polynomial time
Information and Control
Full abstraction for sequential algorithms: the state of the art
Algebraic methods in semantics
Proceedings of the 4th conference on Logic programming '85
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Fully abstract models of programming languages
Fully abstract models of programming languages
A subset of Concurrent Prolog and its interpreter
Concurrent Prolog
Equivalences of logic programs
Foundations of deductive databases and logic programming
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
A relational language for parallel programming
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
Separating concurrent languages with categories of language embeddings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Differential logic programming
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compositional analysis of modular logic programs
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimizing modular logic languages
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
Compositionality in the puzzle of semantics
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Non-Standard Semantics for Program Slicing
Higher-Order and Symbolic Computation
Compositional semantics for linguistic formalisms
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Transforming semantics by abstract interpretation
Theoretical Computer Science
Relativized Hyperequivalence of Logic Programs for Modular Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
Modular Equivalence for Normal Logic Programs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
S-semantics for logic programming: A retrospective look
Theoretical Computer Science
Abstract interpretation of resolution-based semantics
Theoretical Computer Science
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
Relativized hyperequivalence of logic programs for modular programming
Theory and Practice of Logic Programming
Modularity aspects of disjunctive stable models
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Modularity in SMODELS programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Modular answer set programming
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Theoretical foundations and semantics of logic programming
A 25-year perspective on logic programming
Towards modular development of typed unification grammars
Computational Linguistics
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
First-Order encodings for modular nonmonotonic datalog programs
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Hi-index | 0.00 |
We propose a framework for discussing fully abstract compositional semantics, which exposes the interrelations between the choices of observables, compositions, and meanings. Every choice of observables and compositions determines a unique fully abstract equivalence. A semantics is fully abstract if it induces this equivalence.We study the semantics of logic programs within this framework. We find the classical Herbrand-base semantics of logic programs inadequate, since it identifies programs that should be distinguished and vice versa. We therefore propose alternative semantics, and consider the cases of no compositions, composition by program union, and composition of logic modules (programs with designated exported and imported predicates). Although equivalent programs can be in different vocabularies, we prove that our fully abstract semantics are always in a subvocabulary of that of the program. This subvocabulary, called the essential vocabulary, is common to all equivalent programs. The essential vocabulary is also the smallest subvocabulary in which an equivalent program can be written.