5506 search results - page 282 / 1102 » Minimal Logic Programs |
155
Voted
WLP
2004
Springer
15 years 10 months 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...
141
Voted
KSEM
2010
Springer
15 years 2 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
114
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically impact both size and perf...
237
click to vote
ECOOP
2009
Springer
16 years 5 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
113
Voted
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...