Sciweavers

593 search results - page 96 / 119
» RDF and Logic: Reasoning and Extension
Sort
View
CORR
2010
Springer
84views Education» more  CORR 2010»
14 years 10 months ago
Rewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
Issam Maamria, Michael Butler
LOPSTR
2009
Springer
15 years 7 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...
SAC
2006
ACM
15 years 6 months ago
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
Traditional semantic web query languages support a logicbased access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and...
Abraham Bernstein, Christoph Kiefer
ICLP
2010
Springer
15 years 4 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano
ASP
2005
Springer
15 years 2 months ago
Exploiting ASP for Semantic Information Extraction
Abstract. The paper describes HıLεX, a new ASP-based system for the extraction of information from unstructured documents. Unlike previous systems, which are mainly syntactic, H...
Massimo Ruffolo, Nicola Leone, Marco Manna, Domeni...