Sciweavers

120 search results - page 7 / 24
» From CTL to Datalog
Sort
View
WWW
2007
ACM
15 years 10 months ago
From SPARQL to rules (and back)
As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two ...
Axel Polleres
ATAL
1995
Springer
15 years 1 months ago
Time, Knowledge, and Choice
Abstract. This article considers the link between theory and practice in agentoriented programming. We begin by rigorously defining a new formal specification language for autono...
Michael Wooldridge
ENTCS
2010
136views more  ENTCS 2010»
14 years 7 months ago
A Solver for Modal Fixpoint Logics
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
Oliver Friedmann, Martin Lange
VLDB
2003
ACM
141views Database» more  VLDB 2003»
15 years 10 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
LPNMR
1999
Springer
15 years 1 months ago
On the Role of Negation in Choice Logic Programs
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
Marina De Vos, Dirk Vermeir