Filters








914 Hits in 3.9 sec

Modeling CDC in a fuzzy description logic A comparison of different approaches

Martin Unold, Christophe Cruz
2019 Proceedings of the 2019 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology (EUSFLAT 2019)  
The development of description logics for qualitative spatial calculi has also been done.  ...  The theory of vague description logics is used and applied on the cardinal direction calculus.  ...  In more expressive description logics, there exist more connectives for composite concepts.  ... 
doi:10.2991/eusflat-19.2019.86 dblp:conf/eusflat/UnoldC19 fatcat:te2rkhhuz5dh5c3kihpmo7evfu

Towards spatial reasoning on building information models [chapter]

André Borrmann, Jakob Beetz
2010 eWork and eBusiness in Architecture, Engineering and Construction  
The one relevant for the work presented here is OWL DL (description logic), which is based on the logic SHOIN(D) (Horrocks et al., 2003) .  ...  Another one is the Cardinal Direction Calculs (CDC) introduced in (Goyal & Egenhofer 1997) for representing directional relations between connected regions.  ... 
doi:10.1201/b10527-13 fatcat:7qmqexpcn5eevbo6a4ttlegh4u

Some varieties of qualitative probability [chapter]

Michael P. Wellman
1995 Lecture Notes in Computer Science  
via connectivity in a graph.  ...  Its negation, p, denotes "less likely", and its symmetric restriction, ~, "equally likely".  ... 
doi:10.1007/bfb0035948 fatcat:kwmscel3mzai3cfmugki3ehthy

OWL DL vs. OWL flight

Jos de Bruijn, Rubén Lara, Axel Polleres, Dieter Fensel
2005 Proceedings of the 14th international conference on World Wide Web - WWW '05  
In this paper we present OWL Flight, which is loosely based on OWL, but the semantics is grounded in Logic Programming rather than Description Logics, and it borrows the constraint-based modeling style  ...  OWL has a number of problems in the area of interoperability and usability in the context of many practical application scenarios which impede the connection to the Software Engineering and Database communities  ...  We took Description Logic Programs [12] (the intersection of Description Logics and Logic Programming) as a basis and extended it with cardinality and value constraints, meta-modeling and powerful datatype  ... 
doi:10.1145/1060745.1060836 dblp:conf/www/BruijnLPF05 fatcat:nijmne2rfbfgzh2srzanlkv2km

A constructive approach to state description semantics

Ruurik Holm
2003 Journal of Applied Logic  
cardinalities.  ...  The conceptual background of the paper is Carnap's state description semantics, which is given a new interpretation in Martin-Löf's nonstandard type theory.  ...  Nonstandard type theory with its infinitely proceeding sequences thus creates new prospects for the program of inductive logic.  ... 
doi:10.1016/s1570-8683(03)00003-x fatcat:wrxzv4eqvrbz5e63cd6zcln7ki

The Prospects for Mathematical Logic in the Twenty-First Century

Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore
2001 Bulletin of Symbolic Logic  
The four authors present their speculations about the future developments of mathematical logic in the twenty-first century.  ...  The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.  ...  Moving beyond descriptive set theory, I will concentrate on two other major aspects: the theory of large cardinals and the theory ofsmall cardinals. The theory of large cardinals.  ... 
doi:10.2307/2687773 fatcat:mdamfnfy55atzalpnh7ul3xv6m

Decision procedures for some strong hybrid logics

Andrzej Indrzejczak, Michał Zawidzki
2013 Logic and Logical Philosophy  
Tableau calculus for the logic H(@, E, D, ♦ − ) Tableau calculi. Two main types of tableau calculi for hybrid logics are present in the literature, namely the prefixed and the internalised calculi.  ...  So far, several tableau calculi for hybrid logics have been presented in the literature.  ...  A part of this paper is an extended and modified version of an article by Michał Zawidzki, published in the Proceedings of the Student Session of European Summer School of Logic, Language and Information  ... 
doi:10.12775/llp.2013.022 fatcat:26kmz56lijga7asnhuqan7v5li

Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? [chapter]

Stéphane Demri
1999 Lecture Notes in Computer Science  
Indeed, we present sequent calculi for fragments of classical logic that are syntactic variants of the sequent calculi for the nominal tense logics.  ...  The calculi are based on d'Agostino and Mondadori's calculus KE and therefore they admit a restricted cutrule that is not eliminable.  ...  Numerous description logics can be also treated within our framework  ... 
doi:10.1007/3-540-48754-9_15 fatcat:loffob4lqjay3pjisoltk2fsta

ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$

Szymon Klarman, Ulle Endriss, Stefan Schlobach
2010 Journal of automated reasoning  
In this paper we introduce two novel reasoning calculi for solving ABox abduction problems in the Description Logic ALC, i.e. problems of finding minimal sets of ABox axioms, which when added to the knowledge  ...  Due to the growing popularity of Description Logics-based knowledge representation systems, predominantly in the context of Semantic Web applications, there is a rising demand for tools offering non-standard  ...  Under flattening the qualifying concept descriptions in the quantification restrictions are replaced with new predicate symbols, which are then related to the descriptions by means of separate GCIs.  ... 
doi:10.1007/s10817-010-9168-z fatcat:kvdnqqzsinhbliwmqree3wcgfa

The prospects for mathematical logic in the twenty-first century [article]

Samuel R. Buss and Alexander S. Kechris and Anand Pillay and Richard A. Shore
2002 arXiv   pre-print
The four authors present their speculations about the future developments of mathematical logic in the twenty-first century.  ...  The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.  ...  Moving beyond descriptive set theory, I will concentrate on two other major aspects: the theory of large cardinals and the theory of small cardinals. The theory of large cardinals.  ... 
arXiv:cs/0205003v1 fatcat:i3rpwamx6nfdzi5kqkrt34twkq

CHRONOS: A Tool for Handling Temporal Ontologies in Protégé

A. Preventis, P. Marki, E. G. M. Petrakis, S. Batsakis
2012 2012 IEEE 24th International Conference on Tools with Artificial Intelligence  
., property restrictions of temporal classes might refer to the new classes rather than to the classes on which they were meant to be defined).  ...  DEALING WITH CARDINALITY CONSTRAINTS AND PROPERTY RESTRICTIONS OWL classes are described through 'class descriptions'. A property restriction is a special kind of class description.  ...  Temporal Description Logics (TDLs) [1] extend standard description logics (DLs) that form the basis for semantic Web standards with additional constructs such as "always in the past", "sometime in the  ... 
doi:10.1109/ictai.2012.69 dblp:conf/ictai/PreventisMPB12 fatcat:7sb4c66pvrd6hpwe74krwxy3yu

A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming

GEORGE BARYANNIS, ILIAS TACHMAZIDIS, SOTIRIS BATSAKIS, GRIGORIS ANTONIOU, MARIO ALVIANO, EMMANUEL PAPADAKIS
2020 Theory and Practice of Logic Programming  
Well over 40 qualitative calculi have been proposed so far, mostly in the spatial and temporal domains, with several practical applications such as naval traffic monitoring, warehouse process optimisation  ...  proposed encodings outperform one of the two reasoners, but fall behind the other, an acceptable trade-off given the added benefits of handling any type of reasoning as well as the interpretability of logic  ...  et al. 2013 ) and the connected variant of the Cardinal Direction Constraints (CDC) calculus (Skiadopoulos and Koubarakis 2005) .  ... 
doi:10.1017/s1471068420000198 fatcat:gqqpwggpnzbktkr7bgmzexex4a

Labelled Tableaux for Temporal Logic with Cardinality Constraints

Clare Dixon, Boris Konev, Renate A. Schmidt, Dmitry Tishkovsky
2012 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing  
In this paper, we consider reasoning about problems specified in propositional linear time temporal logics in the presence of such constraints on literals.  ...  TEMPORAL LOGIC WITH CARDINALITY CONSTRAINTS A TLC problem is a pair (ϕ, C), where ϕ is a PTL formula and C is a finite set of cardinality constraints.  ...  This allows us to accommodate constraints into the language as a logical connective.  ... 
doi:10.1109/synasc.2012.47 dblp:conf/synasc/DixonKST12 fatcat:qtsltl4dprft7kkrupgybhogqa

A Standard Internal Calculus for Lewis' Counterfactual Logics [chapter]

Nicola Olivetti, Gian Luca Pozzato
2015 Lecture Notes in Computer Science  
The logic V is the basic logic of counterfactuals in the family of Lewis' systems. It is characterized by the whole class of so-called sphere models. We propose a new sequent calculus for this logic.  ...  Our calculus is standard in the sense that each connective is handled by a finite number of rules with a fixed and finite number of premises.  ...  Gian Luca Pozzato is supported by the project "ExceptionOWL: Nonmonotonic Extensions of Description Logics and OWL for defeasible inheritance with exceptions", progetti di ricerca di Ateneo anno 2014,  ... 
doi:10.1007/978-3-319-24312-2_19 fatcat:a4m4ur24ordqzjranwbpnqyrb4

A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming [article]

George Baryannis, Ilias Tachmazidis, Sotiris Batsakis, Grigoris Antoniou, Mario Alviano, Emmanuel Papadakis
2020 arXiv   pre-print
Well over 40 qualitative calculi have been proposed so far, mostly in the spatial and temporal domains, with several practical applications such as naval traffic monitoring, warehouse process optimisation  ...  proposed encodings outperform one of the two reasoners, but fall behind the other, an acceptable trade-off given the added benefits of handling any type of reasoning as well as the interpretability of logic  ...  et al. 2013 ) and the connected variant of the Cardinal Direction Constraints (CDC) calculus (Skiadopoulos and Koubarakis 2005) .  ... 
arXiv:2008.01519v1 fatcat:7axany7zevgnnitrqvp3ihjem4
« Previous Showing results 1 — 15 out of 914 results