90 search results - page 6 / 18 » Discovering Classes of Strongly Equivalent Logic Programs |
MSCS
2008
13 years 8 months ago
2008
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
JAIR
2006
13 years 8 months ago
2006
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
ICECCS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper formalizes the notion of a design model structurally conforming to a design pattern by representing the model as a logic program whilst the pattern as a query. The conf...
MFCS
2009
Springer
14 years 3 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 ...