48 search results - page 3 / 10 » A Logical Characterisation of Static Equivalence |
ICLP
2007
Springer
14 years 4 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
FOSSACS
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
APLAS
2006
ACM
14 years 1 months ago
2006
ACM
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
MFCS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
ICCAD
2005
IEEE
14 years 6 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...