87 search results - page 3 / 18 » An Experimental Comparison of Constraint Logic Programming a... |
ASP
2005
Springer
13 years 10 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”...
AAAI
2006
13 years 6 months ago
2006
IJSSE
2011
13 years 7 days ago
2011
The Extensible Markup Language is susceptible to security breaches because it does not incorporate methods to protect the information it encodes. Our work presented in this paper f...
ASP
2005
Springer
13 years 10 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
ICLP
2009
Springer
14 years 6 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...