PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A transformation system for deductive database modules with perfect model semantics
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the eleventh international conference on Logic programming
Transformations of CLP modules
Theoretical Computer Science
ACM Transactions on Database Systems (TODS)
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Testing the Equivalence of Logic Programs under Stable Model Semantics
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
Automated Verification of Weak Equivalence within the smodels System*
Theory and Practice of Logic Programming
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Magic sets and their application to data integration
ICDT'05 Proceedings of the 10th international conference on Database Theory
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
Theory and Practice of Logic Programming
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
Here's the Beef: Answer Set Programming !
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Engineering an Incremental ASP Solver
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Relativized Hyperequivalence of Logic Programs for Modular Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Removing Redundancy from Answer Set Programs
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
Hyperequivalence of logic programs with respect to supported models
Annals of Mathematics and Artificial Intelligence
Modular Equivalence in General
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Hyperequivalence of logic programs with respect to supported models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
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
MWeb: A principled framework for modular web rule bases and its semantics
ACM Transactions on Computational Logic (TOCL)
Theory and Practice of Logic Programming
Reactive answer set programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Modularity in the rule interchange format
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
A semantic account for modularity in multi-language modelling of search problems
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Hi-index | 0.00 |
A Gaifman-Shapiro-style architecture of program modules is introduced in the case of normal logic programs under stable model semantics. The composition of program modules is suitably limited by module conditions which ensure the compatibility of the module system with stable models. The resulting module theorem properly strengthens Lifschitz and Turner's splitting set theorem [17] for normal logic programs. Consequently, the respective notion of equivalence between modules, i.e. modular equivalence, proves to be a congruence relation. Moreover, it is shown how our translation-based verification method [15] is accommodated to the case of modular equivalence; and how the verification of weak/visible equivalence can be optimized as a sequence of module-level tests.