Prolog Based Description Logic Reasoning

Lukácsy, Gergely; Szeredi, Péter; Kádár, Balázs

doi:10.1007/978-3-540-89982-2_40

Cited by 10 publications

(9 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lukácsy and Szeredi incorporate this algorithm into a reasoning system named DLog, which generates Prolog programs from first-order clauses [46]. Extensions to DLog introduce optimization techniques including partial evaluation, which avoids the execution of unary predicates with uninstantiated arguments [85]; and parallel query execution [86].…”

Section: Integrating Owl and Prologmentioning

confidence: 99%

Cascading verification: an integrated method for domain-specific model checking

Zervoudakis

Rosenblum

Elbaum

et al. 2013

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

View full text Add to dashboard Cite

First and foremost, I would like to thank my supervisors, David S. Rosenblum and Anthony Finkelstein, for their support during the past three years. I am indebted to David for his help and patience; for providing me the freedom to pursue interesting research; and for considering with me over long Skype calls the finer points of OWL-LP integration in the context of domain-specific and probabilistic model checking. Anthony's advice on authoring compelling narratives that clarify complex research, and his encouragement and strategic guidance, have been invaluable for my development as a researcher. I have been fortunate to visit the Nebraska Intelligent MoBile Unmanned Systems (NIMBUS) Lab at the University of Nebraska-Lincoln (UNL). I would like to thank Sebastian Elbaum, co-founder of NIMBUS, for working with me to focus the research in this thesis, and for his contribution throughout my PhD. I would also like to thank Emmanuel Letier for his insightful feedback during my first and second year vivas. And I would like to thank faculty and staff at the Department of Computer Science at University College London (UCL) for providing me with the resources to develop this thesis. In particular, I would like to thank Dean Mohamedally,

show abstract

Section: Integrating Owl and Prologmentioning

confidence: 99%

Cascading verification: an integrated method for domain-specific model checking

Zervoudakis

Rosenblum

Elbaum

et al. 2013

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

View full text Add to dashboard Cite

show abstract

“…Horrocks and Patel-Schneider (1999) for a discussion of how search may be pruned in tableau provaers for ontologies). CDF's approach may be distinguished from Lukacsy et al (2008), which also combines ontological deduction with Prolog. Type-0 ontologies rely on WFS reasoning and so achieve good scalability under a weak semantics; theorem proving for Type-1 ontologies is used only when needed.…”

Section: Related Workmentioning

confidence: 99%

“…Type-0 ontologies rely on WFS reasoning and so achieve good scalability under a weak semantics; theorem proving for Type-1 ontologies is used only when needed. Lukacsy et al (2008) take a more uniform approach to deduction which relies on WAM-level extensions for efficiency; to our knowledge this approach is research-oriented, and has not been used commercially.…”

Section: Related Workmentioning

confidence: 99%

A goal-directed implementation of query answering for hybrid MKNF knowledge bases

Gomes¹,

Alferes²,

Swift³

2013

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning, while the leading semantics for rules use non-monotonic, closed-world reasoning. One exception is the tightly coupled framework of Minimal Knowledge and Negation as Failure (MKNF), which allows statements about individuals to be jointly derived via entailment from ontology and inferences from rules. Nonetheless, the practical usefulness of MKNF has not always been clear, although recent work has formalized a general resolution-based method for querying MKNF when rules are taken to have the well-founded semantics, and the ontology is modeled by a general oracle. That work leaves open what algorithms should be used to relate the entailments of the ontology and the inferences of rules. In this paper we provide such algorithms, and describe the implementation of a query-driven system, CDF-Rules, for hybrid knowledge bases combining both (non-monotonic) rules under the well-founded semantics and a (monotonic) ontology, represented by the Coherent Description Framework Type-1 ($\mathcal{ALCQ}$) theory.

show abstract

“…I work as member of a team developing the DLog DL data reasoner [7], available to download at http://www.dlog-reasoner.org. This is a resolution based reasoner, built on principles similar to KAON2.…”

Section: Started My Phd At Budapest University Of Technology In Sepmentioning

confidence: 99%

Two Phase Description Logic Reasoning for Efficient Information Retrieval

Zombori

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Description Logics are used more and more frequently for knowledge representation, creating an increasing demand for efficient automated DL reasoning. However, the existing implementations are inefficient in the presence of large amounts of data. This paper summarizes the results in transforming DL axioms to a set of function-free clauses of first-order logic which can be used for efficient, query oriented data reasoning. The described method has been implemented in a module of the DLog reasoner openly available on SourceForge to download. ACM Subject Classification I.2.3: Deduction and Theorem Proving

show abstract

Prolog Based Description Logic Reasoning

Cited by 10 publications

References 3 publications

Cascading verification: an integrated method for domain-specific model checking

Cascading verification: an integrated method for domain-specific model checking

A goal-directed implementation of query answering for hybrid MKNF knowledge bases

Two Phase Description Logic Reasoning for Efficient Information Retrieval

Contact Info

Product

Resources

About