308 search results - page 30 / 62 » Answer Set Programming Based on Propositional Satisfiability |
121
click to vote
IJCAI
2007
15 years 3 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
124
click to vote
PLILP
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
139
click to vote
RTA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
133
click to vote
JAR
2000
15 years 1 months ago
2000
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
134
click to vote
DLOG
2008
15 years 4 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...