1144 search results - page 60 / 229 » Logic programming for combinatorial problems |
158
click to vote
IFIP
2001
Springer
15 years 6 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
134
Voted
LFCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
137
click to vote
ASP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
239
click to vote
ICLP
2009
Springer
16 years 2 months ago
2009
Springer
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
122
Voted
PPDP
2009
Springer
15 years 8 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...