Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

PDF

Selected Works

Yuliya Lierler

Modularity for Modeling and Solving in Declarative Programming

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Abstract Modular Systems And Solvers, Yuliya Lierler, Miroslaw Truszczyński Nov 2013

Abstract Modular Systems And Solvers, Yuliya Lierler, Miroslaw Truszczyński

Yuliya Lierler

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 modelfinding 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.


Modular Answer Set Solving, Yuliya Lierler, Miroslaw Truszczyński Nov 2013

Modular Answer Set Solving, Yuliya Lierler, Miroslaw Truszczyński

Yuliya Lierler

Modularity is essential for modeling large-scale practical applications.We propose modular logic programs as a modular version of answer set programming and study the relationship of our formalism to an earlier concept of lp-modules.


Abstract Modular Inference Systems And Solvers, Yuliya Lierler, Miroslaw Truszczyński Nov 2013

Abstract Modular Inference Systems And Solvers, Yuliya Lierler, Miroslaw Truszczyński

Yuliya Lierler

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 multilogic 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.


Research Challenges And Opportunities In Knowledge Representation, Section 4.1.1 Hybrid Kr, Natasha Noy, Deborah Mcguinness, Yuliya Lierler Nov 2013

Research Challenges And Opportunities In Knowledge Representation, Section 4.1.1 Hybrid Kr, Natasha Noy, Deborah Mcguinness, Yuliya Lierler

Yuliya Lierler

Final report edited by Natasha Noy and Deborah McGuinness. Report Section 4.1.1 Hybrid KR, co-authored by Yuliya Lierer, UNO faculty member.