90 search results - page 11 / 18 » Discovering Classes of Strongly Equivalent Logic Programs |
CAV
2009
Springer
14 years 9 months ago
2009
Springer
We present VS3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the pow...
ASP
2005
Springer
14 years 2 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
SIGSOFT
2010
ACM
13 years 6 months ago
2010
ACM
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
JUCS
2006
13 years 8 months ago
2006
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...