Sciweavers

966 search results - page 46 / 194
» Communicating Answer Set Programs
Sort
View
ICLP
2009
Springer
16 years 2 months ago
Modular Nonmonotonic Logic Programming Revisited
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
APAL
2005
135views more  APAL 2005»
15 years 1 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
LPNMR
2005
Springer
15 years 7 months ago
SELP - A System for Studying Strong Equivalence Between Logic Programs
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
Yin Chen, Fangzhen Lin, Lei Li
SAMOS
2010
Springer
15 years 11 days ago
Identifying communication models in Process Networks derived from Weakly Dynamic Programs
—Process Networks (PNs) is an appealing computation ion helping to specify an application in parallel form and realize it on parallel platforms. The key questions to be answered ...
Dmitry Nadezhkin, Todor Stefanov
LPNMR
2001
Springer
15 years 6 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä