Sciweavers

100 search results - page 3 / 20
» Logic Programs with Abstract Constraint Atoms: The Role of C...
Sort
View
LOPSTR
1999
Springer
13 years 10 months ago
Roles of Program Extension
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
Ralf Lämmel, Günter Riedewald, Wolfgang ...
SUM
2007
Springer
13 years 11 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
TCS
2008
13 years 5 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
13 years 10 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
ISMB
1994
13 years 7 months ago
Inductive Logic Programming Used to Discover Topological Constraints in Protein Structures
Thispaperdescribesthe applicationof the Inductive Logic Programming0LP) program GOLEMto the discoveryof constraintsin the packingof beta-sheets in alpha/betaproteins. Theseconstra...
Ross D. King, Dominic A. Clark, Jack Shirazi, Mich...