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

Browsing by Author "Meyer, T"

Sort by: Order: Results:

  • Rens, G; Meyer, T; Casini, G (IOS Press, 2016-08)
    We propose a method for an agent to revise its incomplete probabilistic beliefs when a new piece of propositional information is observed. In this work, an agent’s beliefs are represented by a set of probabilistic formulae ...
  • 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 ...
  • Rens, G; Meyer, T; Lakemeyer, G (COMMONSENSE 2013, 2013-05)
    We investigate the requirements for specifying the behaviors of actions in a stochastic domain. That is, we propose how to write sentences in a logical language to capture a model of probabilistic transitions due to the ...
  • Moodley, D; Seebregts, CJ; Pillay, AW; Meyer, T (Springer link, 2013-08)
    eHealth governance and regulation are necessary in low resource African countries to ensure effective and equitable use of health information technology and to realize national eHealth goals such as interoperability, ...
  • Moodley, K; Meyer, T; Sattler, U (IOS Press, 2014-08)
    Abstract. The preferential approach to nonmonotonic reasoning was consolidated in depth by Krause, Lehmann and Magidor (KLM) for propositional logic in the early 90's. In recent years, there have been e orts to extend ...
  • Klarman, S; Meyer, T (Springer Verlag, 2013-12)
    Stream reasoning is an emerging research area focusing on the development of reasoning techniques applicable to streams of rapidly changing, semantically enhanced data. In this paper, we consider data represented in ...
  • 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 ...
  • Klarman, S; Meyer, T (Springer, 2014-06)
    SQL:2011, the most recently adopted version of the SQL query language, has unprecedentedly standardized the representation of temporal data in relational databases. Following the successful paradigm of ontology-based data ...
  • Nortje, R; Britz, K; Meyer, T (Springer Verlag, 2013-12)
    In this paper we investigate module extraction for the Description Logic SRIQ. We formulate modules in terms of the reachability problem for directed hypergraphs. Using inseperability relations, we investigate the ...
  • Leenen, L; Meyer, T; Ghose, A (Elsevier Science B.V, 2007-03)
    The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework preferences can be associated with tuples of values ...
  • Casini, G; Meyer, T; Moodley, K; Nortjé, R (Springer International Publishing, 2014-09)
    Among the various proposals for defeasible reasoning for description logics, Rational Closure, a procedure originally defined for propositional logic, turns out to have a number of desirable properties. Not only it is ...
  • Rens, G; Meyer, T; Casini, G (Association for the Advancement of Artificial Intelligence, 2016-04)
    We propose a method for an agent to revise its incomplete probabilistic beliefs when a new piece of propositional information is observed. In this work, an agent’s beliefs are represented by a set of probabilistic formulae ...
  • Moodley, K; Meyer, T; Varzinczak, IJ (2011-08)
    In recent years, there has been significant progress in developing tools for debugging and repairing Description Logic (DL)-based ontologies with erroneous consequences. However, these tools place more emphasis on explaining ...
  • 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 ...