764 search results - page 48 / 153 » On the Expressibility of Stable Logic Programming |
112
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
135
Voted
IBERAMIA
2004
Springer
15 years 8 months ago
2004
Springer
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...
121
click to vote
RE
2001
Springer
15 years 7 months ago
2001
Springer
A logic model checker can be an effective tool for debugging software applications. A stumbling block can be that model checking tools expect the user to supply a formal statement...
130
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
219
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...