Sciweavers

50 search results - page 6 / 10
» Towards Automated Integration of Guess and Check Programs in...
Sort
View
LPNMR
2001
Springer
13 years 12 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
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í...
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 7 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
ICLP
2007
Springer
14 years 1 months ago
DLVHEX-SPARQL: A SPARQL Compliant Query Engine Based on DLVHEX
This paper describes the dlvhex SPARQL plugin, a query processor for the upcoming Semantic Web query language standard by W3C. We report on the implementation of this languages usi...
Axel Polleres, Roman Schindlauer
CADE
2007
Springer
14 years 7 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard