157,019 Hits in 19.9 sec

Complexity Results and Practical Algorithms for Logics in Knowledge Representation [article]

Stephan Tobies
2001 arXiv   pre-print
In this thesis, we establish a number of novel complexity results and give practical algorithms for expressive DLs that provide different forms of counting quantifiers.  ...  We provide exact complexity results and a practical, tableau based algorithm for the DL SHIQ, which forms the basis of the highly optimized DL system iFaCT.  ...  We supply a number of novel complexity results and practical algorithms for inference problems.  ... 
arXiv:cs/0106031v1 fatcat:rsp5lyc4pnfjrkqwwe5c2gqwwm

Structuring clinical practice guidelines in a relational database model for decision support on the Internet

D F Lobach, C S Gadd, J W Hales
1997 Proceedings : a conference of the American Medical Informatics Association. AMIA Fall Symposium  
In this paper we describe a database schema based on a relational model for computerizing CPGs using a hybrid of structured and procedural knowledge representation schemes.  ...  We hypothesized that knowledge representation schemes could be developed to capture guideline content and logic within the constraints of a relational database model.  ...  Acknowledgments This work was funded in part by RO1 HS09436-01 from the Agency for Health Care Policy and Research.  ... 
pmid:9357608 pmcid:PMC2233577 fatcat:ywsljoso45bqplfwke532cwqxu

Engineering of Logics for the Content-Based Representation of Information [chapter]

Franz Baader
2004 Lecture Notes in Computer Science  
r understanding of meaning should result in ½ ability to draw conclusions from the represented information ½ ability to determine semantic equivalence of syntactically different representations © F.  ...  r Content-based representation of information r The role of logics and why they must be engineered r Description Logics as a successful instance of this approach r Two applications of DL: Semantic Web  ...  evaluation Dresden Own contributions to this endeavour r Designing expressive knowledge representation formalisms and practical reasoning tools, application in chemical process engineering, databases  ... 
doi:10.1007/978-3-540-30227-8_2 fatcat:kuqsfxcsnnbsvcay7ln3uwrs6a

In a Nutshell: Perceptron Connectives in Knowledge Representation (Extended Abstract)

Pietro Galliani, Guendalina Righetti, Oliver Kutz, Daniele Porello, Nicolas Troquard
2021 International Workshop on Description Logics  
(see e.g. [6]). 1 In [12] , threshold operators were studied in the context of Knowledge Representation, focusing in particular on Description Logics (DLs) (see [5] for an introduction to DL).  ...  In this brief abstract, we summarise the basic complexity and usability results obtained in [10].  ...  In our view, these two results strongly validate the usefulness of threshold expressions in the context of knowledge representation in general and DL specifically.  ... 
dblp:conf/dlog/GallianiRKPT21 fatcat:btdahghlbrf4zcoepfzvbpwsue

Reasoning about distances

Frank Wolter, Michael Zakharyaschev
2003 International Joint Conference on Artificial Intelligence  
To be able to express knowledge about implicit or unknown distances, we then extend the language with variables ranging over distances and prove that the resulting logic is decidable as well.  ...  We investigate its computational properties (in particular, show that it is EXPTIMEcomplete) and devise a tableau-based satisfiabilitychecking algorithm.  ...  Thanks are due to Anatoli Degtyarev, Ian Hodkinson, Carsten Lutz, and Oliver Kutz for stimulating discussions and remarks on the preliminary versions of the paper.  ... 
dblp:conf/ijcai/WolterZ03 fatcat:xk2xkpv72fdnvgyivfte2mzu7y


Lauma Jokste
2019 Environment Technology Resources Proceedings of the International Scientific and Practical Conference  
Some adaptation logics representation techniques are complex and require specific knowledge and skills to manage and modify adaptation process.  ...  This problem can be solved by implementing adaptation algorithms in enterprise applications, so they can be adjusted for specific context situations and specific users' needs.  ...  Experiment results also allowed to compare adaptation process comprehensibility for different adaptation logics representation formats.  ... 
doi:10.17770/etr2019vol2.4156 fatcat:xgnszrdhubfzhkbpcmrtjmnmnu

Logical characterizations of computational complexity classes [article]

Vladimir Naidenko
2020 arXiv   pre-print
In this direction, it is possible to describe combinatorial problems exclusively by logical methods, without resorting to the use of complicated algorithms.  ...  Descriptive complexity theory is an important area in the study of computational complexity.  ...  President of the European Association for logic in computer science Dawar [5] in 2010 at the International conference "Fields of Logic and Computation" (Fields of Logic and Computation) expressed the  ... 
arXiv:2012.07514v1 fatcat:2gagemdshnh23jv2j5k4x4xtl4

Knowledge Representation for Algorithmic Audits

P Di Maio
2020 Zenodo  
Applying KR constructs and good practices to Algorithmic Auditing  ...  TYPE OF Algorithmic Auditing STRENGTH WEAKNESS Knowledge Representation For Algorithmic Audits I n relation to Knowledge Representation, a Knowledge Audit seeks to answer questions such as: Is knowledge  ...  A sample checklist is synthesized from good practices in KR and offered here as a set of heuristic criteria to guide developers who may want to attempt creating an algorithm for algorithmic auditability  ... 
doi:10.5281/zenodo.3978806 fatcat:w3y22udd3jdtpch5oo5wc527vm

Origins of Answer-Set Programming - Some Background And Two Personal Accounts [article]

Victor W. Marek, Ilkka Niemela, Miroslaw Truszczynski
2011 arXiv   pre-print
logic programming.  ...  We give a general overview of the roots of ASP and follow up with the personal perspective on research developments that helped verbalize the main principles of ASP and differentiated it from the classical  ...  in the logic programming and knowledge representation communities.  ... 
arXiv:1108.3281v1 fatcat:kioh3cangrchbnkk5heilbhloi

Utility and Feasibility of Reasoning beyond Decidability in Semantic Technologies [chapter]

Sebastian Rudolph, Michael Schneider
2011 Lecture Notes in Computer Science  
Semantic Web knowledge representation standards such as RDF and OWL have gained momentum in the last years and are widely applied today.  ...  In the course of the standardization process of these and other knowledge representation formalisms, decidability of logical entailment has often been advocated as a central design criterion.  ...  Introduction Today, the Semantic Web serves as the primary testbed for practical application of knowledge representation.  ... 
doi:10.1007/978-3-642-22688-5_2 fatcat:sv3amgn2tfckliapi3hy7yrb34

Forthcoming papers

1996 Artificial Intelligence  
from knowledge representation.  ...  These results suggest approaches to solving the utility problem from explanation-based learning, the multiple extension problem from nonmonotonic reasoning and the tractability/completeness tradeoff problem  ...  The complexity of reasoning in this framework reduces to the complexity of a special validity problem of the logic and we obtain various tractability/decidability results.  ... 
doi:10.1016/s0004-3702(96)90005-3 fatcat:fvhmrv34jzbhbjdzed63fyrvnm

Page 5144 of Mathematical Reviews Vol. , Issue 92i [page]

1992 Mathematical Reviews  
As a result, it becomes hard for one to analyze and identify the practical limits of belief revision se- mantics for solving large interesting problems.  ...  , and report some results from the implementation of the algorithms.  ... 

Analyzing the heterogeneity and complexity of Electronic Health Record oriented phenotyping algorithms

Mike Conway, Richard L Berg, David Carrell, Joshua C Denny, Abel N Kho, Iftikhar J Kullo, James G Linneman, Jennifer A Pacheco, Peggy Peissig, Luke Rasmussen, Noah Weston, Christopher G Chute (+1 others)
2011 AMIA Annual Symposium Proceedings  
We discovered that the majority of eMERGE algorithms analyzed include complex, nested boolean logic and negation, with several dependent on cardinality constraints and complex temporal logic.  ...  Indeed, the availability of a formal computable representation that adequately reflects the types of data and logic evidenced in trial designs is a prerequisite for the automatic identification of study-eligible  ...  Finally, we would like to express gratitude to all those algorithm writers who took the time to respond to our survey.  ... 
pmid:22195079 pmcid:PMC3243189 fatcat:iwb3j4yt6zgnnk4si4zf3u3v4a

On the complexity of inference about probabilistic relational models

Manfred Jaeger
2000 Artificial Intelligence  
We obtain the result that assuming NETIME = ETIME this problem is not polynomial for reasonably expressive representation systems.  ...  Our interest here lies in the complexity in terms of the domain under consideration in a specific application instance.  ...  Just as different logics can be compared, and their complexity be analyzed, by considering the classes of models they can define, we derive results for model representation systems in terms of the class  ... 
doi:10.1016/s0004-3702(99)00109-5 fatcat:kjvyvlma4nggtnvhuc4yqp7dp4

Bridging the Paradigm Gap with Rules for OWL

Pascal Hitzler, Jürgen Angele, Boris Motik, Rudi Studer
2005 W3C Workshops  
Furthermore, decidable algorithms are usually amenable for op-timization, even if of high computational complexity, which made it possible to implement practical reasoners for OWL and to apply them to  ...  The algorithm also provided complexity bounds as side results, showing that efficient reasoning with OWL ontologies extended with rules may be feasible even for ontologies with large amount of data.  ... 
dblp:conf/w3c/HitzlerAMS05 fatcat:dqzshmu2mzcebjxcjh4pdorg5i
« Previous Showing results 1 — 15 out of 157,019 results