Filters








833 Hits in 2.9 sec

Semantic Foundation for Preferential Description Logics [chapter]

Katarina Britz, Thomas Meyer, Ivan Varzinczak
2011 Lecture Notes in Computer Science  
In this paper we fill this gap by providing a natural and intuitive semantics for defeasible subsumption in the description logic ALC.  ...  We argue that our semantics paves the way for extending preferential and rational consequence, and therefore also rational closure, to a whole class of logics that have a semantics defined in terms of  ...  Acknowledgments This work was partially funded by Project number 247601, Net2: Network for Enabling Networked Knowledge, from the FP7-PEOPLE-2009-IRSES call.  ... 
doi:10.1007/978-3-642-25832-9_50 fatcat:yqsn7tbff5aizh7zedinz5jlvu

Towards a Paradoxical Description Logic for the Semantic Web [chapter]

Xiaowang Zhang, Zuoquan Lin, Kewen Wang
2010 Lecture Notes in Computer Science  
As a vision for the future of the Web, the Semantic Web is an open, constantly changing and collaborative environment.  ...  Four-valued description logics are not satisfactory for the Semantic Web in that its reasoning is a bit far from standard semantics.  ...  Secondly, signed expansion rules are provided to construct signed tableaus for ABoxes.  ... 
doi:10.1007/978-3-642-11829-6_20 fatcat:ggo2uvjowzakrobjk66psti2ym

Combining Production Systems and Ontologies [chapter]

Martín Rezk, Werner Nutt
2011 Lecture Notes in Computer Science  
We explore the space of design options for combining the traditional closed world semantics of PS with the open world semantics of DL and propose a generic semantics for such combination.  ...  We show how to encode our semantics in a fixpoint extension of first-order logic.  ...  We thank Jos de Bruijn for starting this work with us and the anonymous reviewers for useful comments and feedback.  ... 
doi:10.1007/978-3-642-23580-1_26 fatcat:d3fix6zurneflidtmo63ijmaoq

Foundations of instance level updates in expressive description logics

Hongkai Liu, Carsten Lutz, Maja Miličić, Frank Wolter
2011 Artificial Intelligence  
In description logic (DL), ABoxes are used for describing the state of affairs in an application domain.  ...  Then, DLs only need to include nominals for updated ABoxes to exist, and the size of updated ABoxes is polynomial in the size of both the original ABox and the update.  ...  Finally, we would like to thank the anonymous referees for helpful comments. Appendix A. Proofs for Section 2  ... 
doi:10.1016/j.artint.2011.08.003 fatcat:sy5o53mrjncsvpujo3jbzuhhla

Ontological Foundations of Modelling Security Policies for Logical Analytics [chapter]

Karolina Bataityte, Vassil Vassilev, Olivia Jo Gill
2020 IFIP Advances in Information and Communication Technology  
Modelling of knowledge and actions in AI has advanced over the years but it is still a challenging topic due to the infamous frame problem, the inadequate formalization and the lack of automation.  ...  Our framework has potential use for analysis of a wide range of transactional systems within the financial, commercial and business domains and further work will include analytical level where we can perform  ...  Description Logic ALC as a Modelling Language The syntax and the semantic interpretation is shown in Table 1 .  ... 
doi:10.1007/978-3-030-49161-1_31 fatcat:lfanp6vfdnbszdoxrt7dyt2bku

Towards Constructive DL for Abstraction and Refinement

Michael Mendler, Stephan Scheele
2009 Journal of automated reasoning  
We introduce a constructive version of ALC, called cALC, for which we give a sound and complete Hilbert axiomatisation and a Gentzen tableau calculus showing finite model property and decidability.  ...  to a constructive interpretation.  ...  Acknowledgements We would like to thank the anonymous reviewers for their helpful comments. We also acknowledge the support by the German Research Council (DFG).  ... 
doi:10.1007/s10817-009-9151-8 fatcat:e7hdit7wsbb7fpl6n3l6se7rvm

:{unav)

Alessandro Artale, Enrico Franconi
2012 Annals of Mathematics and Artificial Intelligence  
logics with a constraint based mechanism -to the most principled ones -which consider a combined semantics for the abstract and the temporal domains.  ...  The analysis considers a large spectrum of approaches appearearing in the temporal description logics area: from the loosely coupled approaches -which comprise, for example, the enhancement of simple description  ...  For what concerns the semantics, this tense logic is provided with a Tarski-style semantics.  ... 
doi:10.1023/a:1016636131405 fatcat:nw5nl3qotjei5o6bzy53anfnn4

A Connection Calculus for the Description Logic $$ {\mathcal{ALC}} $$ [chapter]

Fred Freitas, Jens Otten
2016 Lecture Notes in Computer Science  
The problem of reasoning over ontologies written in Description Logic (DL) [1] has received strong interest, particularly after the Semantic Web inception.  ...  The formal system, the ALC Connection Method (ALC CM), displays some desirable features for a DL reasoner,: it is able to perform all DL inference services, namely, subsumption, unsatisfiability (or inconsistency  ...  Another way is mapping ALC constructs to first order logic (FOL) (like in [6] ) and exploiting the semantics defined for FOL. FOL semantics is available, for instance in [3] .  ... 
doi:10.1007/978-3-319-34111-8_30 fatcat:4wwdnwqx6naafewbj5wfu265hy

Learning Concept Lengths Accelerates Concept Learning in ALC [article]

N'Dah Jean Kouagou, Stefan Heindorf, Caglar Demir, Axel-Cyrille Ngonga Ngomo
2022 arXiv   pre-print
In our experiments, CLIP is at least 7.5 times faster than other state-of-the-art concept learning algorithms for ALC -- including CELOE -- and achieves significant improvements in the F-measure of the  ...  Our evaluation results suggest that recurrent neural network architectures perform best at concept length prediction with a macro F-measure ranging from 38% to 92%.  ...  and Climate Action (BMWK) within the project RAKI under the grant no 01MD19012B.  ... 
arXiv:2107.04911v3 fatcat:nvyjmaz3i5c4bg5ydordaqhlhi

On detecting service chains in sensor-driven home network services

Takuya Inada, Kosuke Ikegami, Shinsuke Matsumoto, Masahide Nakamura, Hiroshi Igaki
2012 2012 IEEE International Conference on Pervasive Computing and Communications Workshops  
This paper presents a framework that can characterize and detect the service chains within the home network system (HNS).  ...  When multiple sensor-driven services are deployed in the same environment, execution of a service may trigger other services, successively.  ...  In each action, A.m() denotes a method m() of an appliance A. Let us take the description of ALC.  ... 
doi:10.1109/percomw.2012.6197631 dblp:conf/percom/InadaIMNI12 fatcat:tqtfun5dwrbspjxx5ow5w44nua

A theory and implementation of cognitive mobile robots

G De Giacomo
1999 Journal of Logic and Computation  
We describe an approach to reasoning agents which is based on a formal theory of actions and is actually implemented on a mobile robot working in an office environment.  ...  Specifically, we consider an epistemic extension of Description Logics to provide a new theoretical framework for the representation of dynamic systems, where the agent's reasoning is based on its knowledge  ...  Riccardo Rosati acknowledges Kurt Konolige and the AI Center of SRI International, Menlo Park, for the support provided during his visiting period.  ... 
doi:10.1093/logcom/9.5.759 fatcat:55lyrt75lzenfcvohgddngmrsa

Semantic Service Composition Framework for Multidomain Ubiquitous Computing Applications [chapter]

Mohamed Hilila, Abdelghani Chibani, Karim Djouani, Yacine Amirat
2012 Lecture Notes in Computer Science  
In this paper we propose a semantic framework based on constructive description logic.  ...  The main innovative aspect of our work consists in the formalization of a composition in the form of e-contract semantic statements where the semantic and logic correctness/soundness are formally checked  ...  Recently, Ferrari et al. in [5] have proposed BCDL, a constructive description logic based on information terms semantics. This logic allows a constructive interpretation of ALC formulas.  ... 
doi:10.1007/978-3-642-34321-6_30 fatcat:qp4lzpqz5ffgnlig5xymzi5fwu

Verification of Golog Programs over Description Logic Actions [chapter]

Franz Baader, Benjamin Zarrieß
2013 Lecture Notes in Computer Science  
In addition to a logic-based action formalism for describing the environment and the effects of basic actions, they enable the construction of complex actions using typical programming language constructs  ...  In the present paper, we introduce a variant of Golog where basic actions are defined using such a DL-based formalism, and show that the verification problem for such programs is decidable.  ...  Then we define syntax and semantics of Golog programs over DL actions and prove some auxiliary results for such programs.  ... 
doi:10.1007/978-3-642-40885-4_12 fatcat:scvco3qgpffbvcphdljm2ek474

A formal framework for description logics with uncertainty

Volker Haarslev, Hsueh-Ieng Pai, Nematollaah Shiri
2009 International Journal of Approximate Reasoning  
In this paper, we present a framework for knowledge bases with uncertainty expressed in the description logic ALC U , which is a propositionally complete representation language providing conjunction,  ...  The constraint-based reasoning procedure proposed in this paper derives a set of assertions and constraints that encode the semantics of the ALC U knowledge base.  ...  individual name.As in standard DLs, the model being constructed by the ALC U tableau algorithm can be thought of as a forest.  ... 
doi:10.1016/j.ijar.2009.04.009 fatcat:lanke3ohd5dxjh7w7qjgwli424

Reasoning About Actions Using Description Logics with General TBoxes [chapter]

Hongkai Liu, Carsten Lutz, Maja Miličić, Frank Wolter
2006 Lecture Notes in Computer Science  
However, existing DL action formalisms fail to include general TBoxes, which are the standard tool for formalising ontologies in modern description logics.  ...  We define a DL action formalism that admits general TBoxes, propose an approach to addressing the ramification problem that is introduced in this way, and perform a detailed investigation of the decidability  ...  We would like to thank Giuseppe De Giacomo for ideas and discussions. The first author was supported by the DFG Project BA1122/10-2.  ... 
doi:10.1007/11853886_23 fatcat:25bxiylhjzhhnm3j6dsx5obobe
« Previous Showing results 1 — 15 out of 833 results