169 search results - page 9 / 34 » Characterizing and checking self-healability |
JLP
2011
13 years 2 months ago
2011
Formal languages for policy have been developed for access control and conformance checking. In this paper, we describe a formalism that combines features that have been developed...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
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...
WLP
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
JSC
2007
13 years 7 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...