Sciweavers

3738 search results - page 505 / 748
» Parametrized Logic Programming
Sort
View
119
Voted
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 5 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...
93
Voted
TOOLS
2000
IEEE
15 years 5 months ago
Extending Business Objects with Business Rules
It is common to imbed business rules within the code of distributed object systems. When business practices and/or policies change, as they often do, it is difficult if not imposs...
Isabelle Rouvellou, Lou Degenaro, Kevin Rasmus, Da...
ECAI
2000
Springer
15 years 5 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
90
Voted
EUROPAR
1999
Springer
15 years 5 months ago
DAOS - Scalable And-Or Parallelism
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
Luís Fernando Castro, Vítor Santos C...
PLILP
1994
Springer
15 years 4 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...