426 search results - page 61 / 86 » Combining Answer Sets of Nonmonotonic Logic Programs |
ENTCS
2002
13 years 7 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
LPNMR
2001
Springer
14 years 4 days ago
2001
Springer
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...
DEXA
2000
Springer
14 years 1 days ago
2000
Springer
The aim of this paper is to show a method that is able to detect a particular class of semantic inconsistencies in a rule-based system (RBS). A semantic inconsistency is defined by...
AAAI
2007
13 years 10 months ago
2007
Generality or refinement relations between different theories have important applications to generalization in inductive logic programming, refinement of ontologies, and coordin...
AGP
2003
IEEE
14 years 1 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...