PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A logical analysis of modules in logic programming
Journal of Logic Programming
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Logic programs with classical negation
Logic programming
Journal of the ACM (JACM)
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
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Building a knowledge base: an example
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
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Complexity Results for Checking Distributed Implementability
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Temporal phylogenetic networks and logic programming
Theory and Practice of Logic Programming
Automated Verification of Weak Equivalence within the smodels System*
Theory and Practice of Logic Programming
Inferring Phylogenetic Trees Using Answer Set Programming
Journal of Automated Reasoning
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
A Translation-based Approach to the Verification of Modular Equivalence
Journal of Logic and Computation
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Modularity aspects of disjunctive stable models
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Clasp: a conflict-driven answer set solver
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
Extended ASP tableaux and rule redundancy in normal logic programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
CMODELS: SAT-based disjunctive answer set solver
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
TOAST: applying answer set programming to superoptimisation
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Magic sets and their application to data integration
ICDT'05 Proceedings of the 10th international conference on Database Theory
Modular Equivalence in General
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Modular Nonmonotonic Logic Programming Revisited
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Relevance-Driven Evaluation of Modular Nonmonotonic Logic Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A Module-Based Framework for Multi-language Constraint Modeling
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
Symmetric splitting in the general theory of stable models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A Formal Theory for Modular ERDF Ontologies
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Stable models and circumscription
Artificial Intelligence
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Pushing efficient evaluation of HEX programs by modular decomposition
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Characterizing strong equivalence for argumentation frameworks
Artificial Intelligence
Weight constraint programs with evaluable functions
Annals of Mathematics and Artificial Intelligence
Connecting first-order ASP and the logic FO(ID) through reducts
Correct Reasoning
Module theorem for the general theory of stable models
Theory and Practice of Logic Programming
A framework for modular ERDF ontologies
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
In this paper, a Gaifman–Shapiro-style module architecture is tailored to the case of smodels programs under the stable model semantics. The composition of smodels program modules is suitably limited by module conditions which ensure the compatibility of the module system with stable models. Hence the semantics of an entire smodels program depends directly on stable models assigned to its modules. This result is formalized as a module theorem which truly strengthens V. Lifschitz and H. Turner's splitting-set theorem (June 1994, Splitting a logic program. In Logic Programming: Proceedings of the Eleventh International Conference on Logic Programming, Santa Margherita Ligure, Italy, P. V. Hentenryck, Ed. MIT Press, 23–37) for the class of smodels programs. To streamline generalizations in the future, the module theorem is first proved for normal programs and then extended to cover smodels programs using a translation from the latter class of programs to the former class. Moreover, the respective notion of module-level equivalence, namely modular equivalence, is shown to be a proper congruence relation: it is preserved under substitutions of modules that are modularly equivalent. Principles for program decomposition are also addressed. The strongly connected components of the respective dependency graph can be exploited in order to extract a module structure when there is no explicit a priori knowledge about the modules of a program. The paper includes a practical demonstration of tools that have been developed for automated (de)composition of smodels programs.