Abstract modular inference systems and solvers

Yuliya Lierler, Miroslaw Truszczynski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce the concepts of abstract inference modules and abstract modular inference systems to study general principles behind the design and analysis of model-generating programs, or solvers, for integrated multi-logic systems. We show how modules and modular systems give rise to transition graphs, which are a natural and convenient representation of solvers, an idea 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 languageEnglish
Title of host publicationPractical Aspects of Declarative Languages - 16th International Symposium, PADL 2014, Proceedings
Pages49-64
Number of pages16
DOIs
StatePublished - 2014
Event15th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2014 - San Diego, CA, United States
Duration: Jan 20 2014Jan 21 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8324 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2014
Country/TerritoryUnited States
CitySan Diego, CA
Period1/20/141/21/14

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Abstract modular inference systems and solvers'. Together they form a unique fingerprint.

Cite this