Sciweavers

432 search results - page 77 / 87
» Open answer set programming for the semantic web
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Heuristics in Conflict Resolution
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 20 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
C5
2003
IEEE
14 years 1 months ago
SuperSwiki - Bringing collaboration to the class room
SuperSwiki is a not yet well defined term. Its origins go back to Ward Cunningham's Wiki and its Squeak variant, the Swiki. It provides a place to share and edit web pages, f...
Michael Rüger
ATAL
2008
Springer
13 years 10 months ago
Belief operations for motivated BDI agents
The beliefs of an agent reflecting her subjective view of the world constitute one of the main components of a BDI agent. In order to incorporate new information coming from other...
Patrick Krümpelmann, Matthias Thimm, Manuela ...
FOIKS
2006
Springer
13 years 11 months ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov