Sciweavers

3572 search results - page 30 / 715
» Nominal Logic Programming
Sort
View
EUSFLAT
2003
102views Fuzzy Logic» more  EUSFLAT 2003»
14 years 11 months ago
Homogenizing multi-adjoint logic programs
The concept of homogeneous multi-adjoint logic program is introduced, and a procedure to homogenize an arbitrary multi-adjoint logic program is presented. The procedure is proved ...
Jesús Medina, Manuel Ojeda-Aciego
LFCS
2007
Springer
15 years 4 months ago
Compactness Properties for Stable Semantics of Logic Programs
Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of mode...
Victor W. Marek, Jeffrey B. Remmel
69
Voted
TPLP
2008
118views more  TPLP 2008»
14 years 10 months ago
Logic programming with satisfiability
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming f...
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
CORR
2010
Springer
140views Education» more  CORR 2010»
14 years 10 months ago
Automated Termination Analysis for Logic Programs with Cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Peter Schneider-Kamp, Jürgen Giesl, Thomas St...
LPNMR
2004
Springer
15 years 3 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
Thomas Eiter, Axel Polleres