Sciweavers

193 search results - page 6 / 39
» Dynamical Properties of Answer Set Programs
Sort
View
PASTE
2004
ACM
14 years 3 months ago
Dynamically inferring temporal properties
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...
Jinlin Yang, David Evans
ASP
2003
Springer
14 years 3 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
LPNMR
2009
Springer
14 years 4 months ago
A Default Approach to Semantics of Logic Programs with Constraint Atoms
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
Yi-Dong Shen, Jia-Huai You
APAL
2005
135views more  APAL 2005»
13 years 9 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
14 years 3 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