Abstract
Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce concepts of abstract modules and abstract modular systems to study general principles behind the design and analysis of model-finding programs, or solvers, for integrated heterogeneous multi-logic systems. We show how abstract modules and abstract modular systems give rise to transition systems, which are a natural and convenient representation of solvers pioneered by the SAT community. We illustrate our approach by showing how it applies to answer set programming and propositional logic, and to multi-logic systems based on these two formalisms.
| Original language | English |
|---|---|
| Pages | 143-158 |
| Number of pages | 16 |
| State | Published - 2013 |
| Event | 6th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2013, co-located with the 29th International Conference on Logic Programming, ICLP 2013 - Istanbul, Turkey Duration: Aug 25 2013 → … |
Conference
| Conference | 6th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2013, co-located with the 29th International Conference on Logic Programming, ICLP 2013 |
|---|---|
| Country/Territory | Turkey |
| City | Istanbul |
| Period | 8/25/13 → … |
Bibliographical note
Publisher Copyright:© 2013 arXiv.org. All rights reserved.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics
- Hardware and Architecture
- Software
- Artificial Intelligence