GENERAL ENQUIRIES: Tel: + 27 12 841 2911 | Email: callcentre@csir.co.za

Browsing by Author "Varzinczak, I"

Sort by: Order: Results:

  • Meyer, T; Moodley, K; Varzinczak, I (2010-08)
    Description Logics (DLs) are widely accepted as an appropriate class of knowledge representation languages to represent and reason about ontologies. Tools for performing standard reasoning tasks such as satisfiability and ...
  • Booth, R; Meyer, T; Varzinczak, I; Wassermann, R (2010-08)
    The authors show that Booth et al.’s Horn contraction based on infra-remainder sets corresponds exactly to kernel contraction for belief sets. This result is obtained via a detour through Horn contraction for belief bases, ...
  • Casini, G; Meyer, T; Moodley, K; Sattler, U; Varzinczak, I (Springer International Publishing, 2015-10)
    In recent years, various approaches have been developed for representing and reasoning with exceptions in OWL. The price one pays for such capabilities, in terms of practical performance, is an important factor that is yet ...
  • Casini, G; Meyer, T; Moodley, K; Varzinczak, I (CAIR (Centre for Artificial Intelligence Research), 2013-07)
    The introduction of defeasible reasoning in Description Logics has been a main research topic in the field in the last years. Despite the fact that various interesting formalizations of nonmonotonic reasoning for the TBox ...
  • Britz, K; Meyer, T; Varzinczak, I (2012-12)
    One of the most successful approaches to the formalization of commonsense reasoning is the work by Lehmann and colleagues, known as the KLM approach, in which defeasible consequence relations with a preferential semantics ...
  • Booth, R; Casini, G; Meyer, T; Varzinczak, I (AAAI Press, 2015-07)
    Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator. In spite of the non-monotonic features introduced by the semantics adopted ...
  • Booth, R; Meyer, T; Varzinczak, I; Wassermann, R (Association for the Advancement of Artificial Intelligence, 2011-09)
    Standard belief change assumes an underlying logic containing full classical propositional logic. However, there are good reasons for considering belief change in less expressive logics as well. In this paper the authors ...
  • Britz, K; Heidema, J; Varzinczak, I (2010-05)
    In this paper the authors venture beyond one of the fundamental assumptions in the non-monotonic reasoning community, namely that non-monotonic entailment is supra-classical. They investigate reasoning which uses an ...
  • Britz, K; Meyer, T; Varzinczak, I (Elsevier, 2011-11)
    Modal logic is the foundation for a versatile and well-established class of knowledge representation formalisms in artificial intelligence. Enriching modal logics with non-monotonic reasoning capabilities such as preferential ...
  • Britz, K; Casini, G; Meyer, T; Varzinczak, I (CAIR (Centre for Artificial Intelligence Research), 2013-07)
    We extend the Description Logic ALC with preferential role restrictions as class constructs, and argue that preferential universal restriction represents a defeasible version of standard universal restriction. The resulting ...
  • Booth, R; Meyer, T; Varzinczak, I (King's College Publications, 2013-08)
    We introduce Propositional Typicality Logic (PTL), a logic for reasoning about typicality. We do so by enriching classical propositional logic with a typicality operator of which the intuition is to capture the most typical ...
  • Moodley, K; Meyer, T; Varzinczak, I (2012-06)
    We discuss two approaches for defeasible reasoning in Description Logics that allow for the statement of defeasible subsumptions of the form “subsumed by usually holds”. These approaches are known as prototypical reasoning ...
  • Booth, R; Meyer, T; Varzinczak, I (Springer, 2012-09)
    We introduce Propositional Typicality Logic (PTL), a logic for reasoning about typicality. We do so by enriching classical propositional logic with a typicality operator of which the intuition is to capture the most typical ...
  • Franconi, E; Meyer, T; Varzinczak, I (2010-05)
    In this paper the authors investigate the problem of maintaining and reasoning with different versions of a knowledge base. The authors are interested in the scenario where a knowledge base (expressed in some logical ...
  • Britz, K; Meyer, T; Varzinczak, I (2011-12)
    Description logics are a well-established family of knowledge representation formalisms in Artificial Intelligence. Enriching description logics with non-monotonic reasoning capabilities, especially preferential reasoning ...
  • Britz, K; Varzinczak, I (2014-07)
    We investigate the notion of dilation of a propositional theory based on neighbourhoods in a generalized approximation space.We take both a semantic and a syntactic approach in order to define a suitable notion of theory ...
  • Casini, G; Meyer, T; Moodley, K; Varzinczak, I (Centre for Artificial Intelligence Research, 2013-07)
    The formalisation of defeasible reasoning in automated systems is becoming increasingly important. Description Logics (DLs) are nowadays the main logical formalism in the field of formal ontologies. Our focus in this paper ...
  • Booth, R; Casini, G; Meyer, T; Varzinczak, I (Commonsense Reasoning, 2015-03)
    We continue recent investigations into the problem of reasoning about typicality. We do so in the framework of Propositional Typicality Logic (PTL), which is obtained by enriching classical propositional logic with a ...