Sciweavers

308 search results - page 30 / 62
» Answer Set Programming Based on Propositional Satisfiability
Sort
View
IJCAI
2007
13 years 9 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
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,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
PLILP
1993
Springer
13 years 11 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
RTA
2010
Springer
13 years 11 months ago
Declarative Debugging of Missing Answers for Maude
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 ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
JAR
2000
77views more  JAR 2000»
13 years 7 months ago
Proving Consistency Assertions for Automotive Product Data Management
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
Wolfgang Küchlin, Carsten Sinz
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
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...
Andrea Calì, Georg Gottlob, Michael Kifer