liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Well-Founded Semantics for Hybrid Rules
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
2007 (English)In: Web Reasoning and Rule Systems: First International Conference, RR 2007, Innsbruck , Austria, June 7-8, 2007. Proceedings / [ed] Massimo Marchiori, Jeff Z. Pan and Christian deSainte Marie, Springer Berlin/Heidelberg, 2007, 1-15 p.Chapter in book (Refereed)
Abstract [en]

The problem of integration of rules and ontologies is addressed in a general framework based on the well-founded semantics of normal logic programs and inspired by the ideas of Constraint Logic Programming (CLP). Hybrid rules are defined as normal clauses extended with constraints in the bodies. The constraints are formulae in a language of a first order theory defined by a set  of axioms. Instances of the framework are obtained by specifying a language of constraints and providing  . A hybrid program is a pair () where  is a finite set of hybrid rules. Thus integration of (non-disjunctive) Datalog with ontologies formalized in a Description Logic is covered as a special case. The paper defines a declarative semantics of hybrid programs and a formal operational semantics. The latter can be seen as an extension of SLS-resolution and provides a basis for hybrid implementations combining Prolog with constraint solvers. In the restricted case of positive rules, hybrid programs are formulae of FOL. In that case the declarative semantics reduces to the standard notion of logical consequence. The operational semantics is sound and it is complete for a restricted class of hybrid programs.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2007. 1-15 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 4524
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-40838DOI: 10.1007/978-3-540-72982-2_1Local ID: 54290ISBN: 978-3-540-72981-5 (print)ISBN: 978-3-540-72982-2 (print)OAI: oai:DiVA.org:liu-40838DiVA: diva2:261687
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2016-06-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textfind book at a swedish library/hitta boken i ett svenskt bibliotek

Authority records BETA

Drabent, WlodzimierzMaluszynski, Jan

Search in DiVA

By author/editor
Drabent, WlodzimierzMaluszynski, Jan
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 51 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf