Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
A theory of diagnosis from first principles
Artificial Intelligence
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the eleventh international conference on Logic programming
Reducing disjunctive to non-disjunctive semantics by shift-operations
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
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
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
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Enhancing disjunctive logic programming systems by SAT checkers
Artificial Intelligence
Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Magic Sets and their application to data integration
Journal of Computer and System Sciences
Automated Verification of Weak Equivalence within the smodels System*
Theory and Practice of Logic Programming
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
Modular Equivalence in General
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A Translation-based Approach to the Verification of Modular Equivalence
Journal of Logic and Computation
A modular action description language
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Macros, macro calls and use of ensembles in modular answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
On Testing Answer-Set Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Theory and Practice of Logic Programming
ASP as a cognitive modeling tool: short-term memory and long-term memory
Logic programming, knowledge representation, 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
Strong equivalence of logic programs with abstract constraint atoms
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Answer set programming at a glance
Communications of the ACM
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
On elementary loops of logic programs
Theory and Practice of Logic Programming
First-Order encodings for modular nonmonotonic datalog programs
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Uniform evaluation of nonmonotonic DL-Programs
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Parameterized splitting: a simple modification-based approach
Correct Reasoning
Annotating answer-set programs in lana*
Theory and Practice of Logic Programming
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
Product and Production Process Modeling and Configuration
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.02 |
Practically all programming languages allow the programmer to split a program into several modules which brings along several advantages in software development. In this paper, we are interested in the area of answer-set programming where fully declarative and nonmonotonic languages are applied. In this context, obtaining a modular structure for programs is by no means straightforward since the output of an entire program cannot in general be composed from the output of its components. To better understand the effects of disjunctive information on modularity we restrict the scope of analysis to the case of disjunctive logic programs (DLPs) subject to stable-model semantics. We define the notion of a DLP-function, where a well-defined input/output interface is provided, and establish a novel module theorem which indicates the compositionality of stable-model semantics for DLP-functions. The module theorem extends the well-known splitting-set theorem and enables the decomposition of DLP-functions given their strongly connected components based on positive dependencies induced by rules. In this setting, it is also possible to split shared disjunctive rules among components using a generalized shifting technique. The concept of modular equivalence is introduced for the mutual comparison of DLP-functions using a generalization of a translation-based verification method.