A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Exploring Parallelization of Conjunctive Branches in Tableau-Based Description Logic Reasoning
2013
International Workshop on Description Logics
Preserved Fulltext
Multiprocessor equipment is cheap and ubiquitous now, but users of description logic (DL) reasoners have to face the awkward fact that the major tableau-based DL reasoners can make use only one of the ...
In this work, we present an algorithm to process conjunctive branches in parallel and address the key implementation aspects of the algorithm. ...
Unfortunately, few such advances have been achieved for tableau-based Description Logic (DL) reasoning, which is the dominant method adopted by the major DL reasoning systems. ...
dblp:conf/dlog/WuH13
fatcat:5l5smtadqfe3rj5y5woywfqz5i
Parallel Computation Techniques for Ontology Reasoning
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
As current reasoning techniques are not designed for massive parallelisation, usage of parallel computation techniques in reasoning establishes a major research problem. ...
I will propose two possibilities of applying parallel computation techniques to ontology reasoning: parallel processing of independent ontological modules, and tailoring the reasoning algorithms to parallel ...
chunks of computation (e.g. branches in a tableau). ...
doi:10.1007/978-3-540-88564-1_60
fatcat:usdfijto6jgyzatr44j55tpke4
A Tableau Based Automated Theorem Prover Using High Performance Computing
2012
Journal of Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Tableau can be used in propositional logic, predicate logic, modal logic, temporal logic, and in other non-classical logics. ...
We also illustrate a tableau based proof system in a distributed environment using the Message Passing Interface. ...
to thank Kazi Shah Newaz Ripon for numerous discussions concerning this work, Abu Shamim Mohammad Arif and Kamrul Hasan Talukder for their assistance with implementation, and the anonymous reviewers of ...
doi:10.4304/jcp.7.3.597-607
fatcat:3fx3hscdwvgglhlitnqnmsqvxm
Bridging the Gap between Tableau and Consequence-Based Reasoning
2014
International Workshop on Description Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We present a non-deterministic consequence-based procedure for the description logic ALCHI. ...
This is similar to tableau-based procedures, for which an ontology is inconsistent if every expansion of the tableau eventually results in a clash. ...
Introduction and Motivation Consequence-based and tableau-based methods are two well-known approaches to reasoning in Description Logics (DLs). ...
dblp:conf/dlog/KazakovK14a
fatcat:ktxdax2bobbjtiulhgxl2fthje
Converting Instance Checking to Subsumption: A Rethink for Object Queries over Practical Ontologies
2015
International Journal of Intelligence Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Efficiently querying Description Logic (DL) ontologies is becoming a vital task in various data-intensive DL applications. ...
With independence between computed MSC's, scalability for query answering can also be achieved by distributing and parallelizing the computations. ...
Acknowledgements This work is partly supported by grant # R44GM097851 from the National Institute of General Medical Sciences, part of the U.S. National Institutes of Health (NIH). ...
doi:10.4236/ijis.2015.51005
pmid:26594595
pmcid:PMC4652860
fatcat:v7qmu4nft5d25e56cbp2hvbz34
Handling Non-determinism with Description Logics using a Fork/Join Approach
2015
International Journal of Networking and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The rise of such powerful execution environments calls for new parallel and distributed Description Logics (DLs) reasoning algorithms. ...
We implement a fork/join parallel framework into our tableau-based algebraic reasoner, which handles qualified cardinality restrictions and nominals using in-equation solving. ...
Parallelizing Non-determinism Tableau-based reasoning has been the most common choice for Description Logics tools. ...
doi:10.15803/ijnc.5.1_61
fatcat:mdnzhhm5qngrdiv6kz67f22grq
Decomposition-based reasoning for large knowledge bases in description logics
2008
Integrated Computer-Aided Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Reasoning in a Knowledge Base (KB) is one of the most important applications of Description Logic (DL) reasoners. ...
In this paper, we investigate a new technique for optimizing DL reasoning in order to minimize the above two factors as much as possible. ...
Decomposition-based Reasoning in Description Logics ...
doi:10.3233/ica-2008-15105
fatcat:47po2xl4xnhmpldppv2krqszoa
Implementation of a Tableau-based Satisfiability Checker for HS3
2017
Italian Conference on Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper we describe an implementation of a tableau-based satisfiability checker for HS3 interpreted in the class of all finite linear orders. ...
Although there exist several decidable fragments of Halpern and Shoham's interval temporal logic HS, the computational complexity of their satisfiability problem tend to be generally high. ...
Conclusions In this paper we have described an efficient implementation of a tableau-based reasoner for the interval temporal logic HS3, whose finite satisfiability problem had been shown to be PSpace-complete ...
dblp:conf/ictcs/Munoz-VelascoSS17
fatcat:4exsjv6ehfdl3pnmx6jlz7szpe
Scalable Web Reasoning Using Logic Programming Techniques
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
DLog performs query-driven execution whereby the terminological part of the description logic knowledge base is converted into a Logic Program and the assertional facts are accessed dynamically from a ...
We identify two kinds of parallelism within DLog execution: (1) the instances in the superset can be independently checked in parallel and (2) a specific instance check can be executed in parallel by specialising ...
Introduction In this paper we describe extensions of DLog, a SHIQ Description Logic (DL) ABox reasoner [1] , using the unique name assumption. ...
doi:10.1007/978-3-642-05082-4_8
fatcat:yvsgs6yrbfb45m3lmglk2uvdvi
Automated reasoning for attributed graph properties
2018
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Secondly, we extend our refutationally complete tableau based reasoning method as well as our symbolic model generation approach for graph properties to attributed graph properties. ...
Finally, our automated reasoning approach for attributed graph properties is implemented in the tool AUTOGRAPH integrating in particular the SMT solver Z3 for the attribute part of the properties. ...
OCL properties are translated into relational logic and reasoning is then performed by KOD-KOD, which is a SAT-based constraint solver for relational logic. ...
doi:10.1007/s10009-018-0496-3
fatcat:r5lmf2d755fcdmb75cagw2l7yq
EXPtime tableaux for ALC
2000
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
On the other hand, current algorithms based on tableau methods can take advantage of such cases, but require double exponential time in the worst case. ...
We propose a tableau calculus for the description logic ALC for checking the satisfiability of a concept with respect to a TBox with general axioms, and transform it into the first simple tableaubased ...
Sebastiani for many useful discussions on modal and description logics theorem proving, M. ...
doi:10.1016/s0004-3702(00)00070-9
fatcat:5bil6begnjerbjh5v6h5amfkq4
Theorem Proving and Model Building with the Calculus KE
1996
Logic Journal of the IGPL
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
open branches in KE trees, and the relation of the KE rules to'traditional' forms of reasoning. c IGPL 130 Theorem Proving and Model Building with the Calculus KE tency of open branches in KE trees, and ...
This rule is called PB (for Principle of Bivalence), which is a 0-premise branching rule and is the only branching rule in KE. ...
and helpful discussions and comments, both on the theoretical aspects of KE and the practical implementation of`leanKE'; and the anonymous reviewers for their constructive comments and suggestions. ...
doi:10.1093/jigpal/4.1.129
fatcat:wtqdyrzrjzfj7cqdgniv3452tq
User Profiles and Matchmaking on Mobile Phones
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The implementation of the system -including a first order model generating theorem prover and a description logic interfacerenders the idea viable in the real world and even enables explanations within ...
In parallel the semantic web provides enabling technologies to annotate and match information with a user's interests. ...
This work is part of the IASON project and is funded by the "Stiftung Rheinland-Pfalz für Innovation". ...
doi:10.1007/11963578_11
fatcat:hh3dbek6o5aqrcipaunjapqts4
A New Rule for LTL Tableaux
2016
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2016 pre-print arXiv:1609.04102v1 fatcat:hrfllll3u5e3rjwkjoxjwx2cqy
In this paper, we introduce a novel style of tableau rule which supports a new simple traditional-style tree-shaped tableau for LTL. We prove that it is sound and complete. ...
Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. ...
It is also unique in allowing separate parallel development of branches. ...
doi:10.4204/eptcs.226.20
fatcat:waeufpkg3bdh5cvq7f5252ru4u
Resource-Adaptive Model Generation as a Performance Model
2003
Logic Journal of the IGPL
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
We embed the new calculus into an abstract inference machine and illustrate the possibilities of this approach by presenting a partial theory of definite descriptions in this setting. ...
Model generation calculi, close relatives of tableau calculi for theorem proving, can be used as competence models for semantic natural language understanding. ...
We would like to thank Peter Baumgartner, Aljoscha Burchardt, Markus Egg, Eleni Miltsakaki, Mandy Simons, Stephan Walter, the participants of the ICOS-2 workshop, and the anonymous referees of an earlier ...
doi:10.1093/jigpal/11.4.435
fatcat:izdhadn765garkgtm3yrvxwuje
« Previous
Showing results 1 — 15 out of 1,430 results