Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDThomas Andreas Meyer
Thomas Meyer 0002 – Tommie Meyer
Person information
- affiliation: CAIR, University of Cape Town
- affiliation: CSIR Meraka, South Africa
- affiliation: University of New South Wales, Australia
Other persons with the same name
- Thomas Meyer — disambiguation page
- Thomas Meyer 0001 — University of Bremen, Germany
- Thomas Meyer 0003
![[0000-0002-1235-1188]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-1235-1188")
— Google Inc., Zurich, Switzerland (and 1 more) - Thomas Meyer 0004 — University of Basel, Department of Mathematics & Computer Science, Switzerland
- Thomas Meyer 0005 — Forschungszentrum Jülich, Institute of Bio- and Geosciences, Germany
- Thomas Meyer 0006 — University of Trier, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[c86]Giovanni Casini, Thomas Meyer, Ivan Varzinczak:
Rational Defeasible Belief Change. KR 2020: 213-222- [e2]Stefan Borgwardt, Thomas Meyer:
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Online Event [Rhodes, Greece], September 12th to 14th, 2020. CEUR Workshop Proceedings 2663, CEUR-WS.org 2020 [contents]
2010 – 2019
- 2019
- [j25]Richard Booth, Giovanni Casini, Thomas Meyer, Ivan Varzinczak:
On rational entailment for Propositional Typicality Logic. Artif. Intell. 277 (2019) - [j24]Giovanni Casini, Umberto Straccia, Thomas Meyer:
A polynomial Time Subsumption Algorithm for Nominal Safe ELO⊥ under Rational Closure. Inf. Sci. 501: 588-620 (2019) - [c85]Katarina Britz, Giovanni Casini, Thomas Meyer, Ivan Varzinczak:
A KLM Perspective on Defeasible Reasoning for Description Logics. Description Logic, Theory Combination, and All That 2019: 147-173 - [c84]Giovanni Casini, Michael Harrison, Thomas Meyer, Reid Swan:
Arbitrary Ranking of Defeasible Subsumption. Description Logics 2019 - [c83]Michael Harrison, Thomas Meyer:
Rational preferential reasoning for datalog. FAIR 2019: 232-243 - [c82]Giovanni Casini, Thomas Meyer, Ivan Varzinczak:
Simple Conditionals with Constrained Right Weakening. IJCAI 2019: 1632-1638 - [c81]Giovanni Casini, Thomas Meyer, Ivan Varzinczak:
Taking Defeasible Entailment Beyond Rational Closure. JELIA 2019: 182-197 - [c80]Leonard Botha, Thomas Meyer, Rafael Peñaloza:
A Bayesian Extension of the Description Logic ALC. JELIA 2019: 339-354 - [i13]Katarina Britz, Giovanni Casini, Thomas Meyer, Kody Moodley, Uli Sattler, Ivan Varzinczak:
Theoretical Foundations of Defeasible Description Logics. CoRR abs/1904.07559 (2019) - [i12]Anthony Hunter, Gabriele Kern-Isberner, Thomas Meyer, Renata Wassermann:
The Role of Non-monotonic Reasoning in Future Development of Artificial Intelligence (Dagstuhl Perspectives Workshop 19072). Dagstuhl Reports 9(2): 73-90 (2019) - 2018
- [c79]Francois Mouton, Michael Pepper, Thomas Meyer:
A Social Engineering Prevention Training Tool: Methodology and Design for Validating the SEADM. HAISA 2018: 12-27 - [c78]Gavin Rens, Thomas Andreas Meyer:
Probabilistic Belief Update via Mixing Endogenous Actions and Exogenous Events. DKB/KIK@KI 2018: 41-54 - [c77]Gavin Rens, Abhaya Nayak, Thomas Andreas Meyer:
Maximizing Expected Impact in an Agent Reputation Network. KI 2018: 99-106 - [c76]Gavin Rens, Thomas Andreas Meyer, Gabriele Kern-Isberner, Abhaya Nayak:
Probabilistic Belief Revision via Similarity of Worlds Modulo Evidence. KI 2018: 343-356 - [c75]Giovanni Casini, Eduardo Fermé, Thomas Meyer, Ivan Varzinczak:
A Semantic Perspective on Belief Change in a Preferential Non-Monotonic Framework. KR 2018: 220-229 - [i11]Giovanni Casini, Umberto Straccia, Thomas Meyer:
A Polynomial Time Subsumption Algorithm for Nominal Safe ELO⊥ under Rational Closure. CoRR abs/1802.08201 (2018) - [i10]Gavin Rens, Abhaya Nayak, Thomas Meyer:
Maximizing Expected Impact in an Agent Reputation Network - Technical Report. CoRR abs/1805.05230 (2018) - [i9]Richard Booth, Giovanni Casini, Thomas Andreas Meyer, Ivan Varzinczak:
On Rational Entailment for Propositional Typicality Logic. CoRR abs/1809.10946 (2018) - 2017
- [j23]Aurona Gerber, Nishal Morar, Thomas Meyer, Connal Eardley:
Ontology-based support for taxonomic functions. Ecol. Informatics 41: 11-23 (2017) - [c74]Giovanni Casini, Thomas Andreas Meyer:
Belief Change in a Preferential Non-monotonic Framework. IJCAI 2017: 929-935 - [c73]Francois Mouton, Marcel Teixeira, Thomas Meyer:
Benchmarking a mobile implementation of the social engineering prevention training tool. ISSA 2017: 106-116 - [i8]Gavin Rens, Thomas Andreas Meyer:
Imagining Probabilistic Belief Change as Imaging (Technical Report). CoRR abs/1705.01172 (2017) - 2016
- [j22]Louise Leenen, Thomas Meyer:
Semantic Technologies and Big Data Analytics for Cyber Defence. Int. J. Cyber Warf. Terror. 6(3): 53-64 (2016) - [c72]Gavin Rens, Thomas Andreas Meyer, Giovanni Casini:
On Revision of Partially Specified Convex Probabilistic Belief Bases. ECAI 2016: 921-929 - [c71]Blessing Ojeme, Audrey Mbogho, Thomas Meyer:
Probabilistic Expert Systems for Reasoning in Clinical Depressive Disorders. ICMLA 2016: 599-604 - [c70]Giovanni Casini, Thomas Andreas Meyer:
Using Defeasible Information to Obtain Coherence. KR 2016: 537-540 - [i7]Gavin Rens, Thomas Andreas Meyer, Giovanni Casini:
Revising Incompletely Specified Convex Probabilistic Belief Bases. CoRR abs/1604.02133 (2016) - 2015
- [c69]Richard Booth, Giovanni Casini, Thomas Meyer, Ivan José Varzinczak:
What Does Entailment for PTL Mean? AAAI Spring Symposia 2015 - [c68]Gavin B. Rens, Thomas Meyer:
A New Approach to Probabilistic Belief Change. FLAIRS Conference 2015: 581-587 - [c67]Gavin Rens, Thomas Andreas Meyer:
A Hybrid POMDP-BDI Agent Architecture with Online Stochastic Planning and Desires with Changing Intensity Levels. ICAART (Revised Selected Papers) 2015: 3-19 - [c66]Gavin Rens, Thomas Andreas Meyer:
Hybrid POMDP-BDI - An Agent Architecture with Online Stochastic Planning and Desires with Changing Intensity Levels. ICAART (1) 2015: 5-14 - [c65]Gavin Rens, Thomas Andreas Meyer, Gerhard Lakemeyer:
A Modal Logic for the Decision-Theoretic Projection Problem. ICAART (2) 2015: 5-16 - [c64]Gavin Rens, Thomas Andreas Meyer, Gerhard Lakemeyer:
A Logic for Reasoning About Decision-Theoretic Projections. ICAART (Revised Selected Papers) 2015: 79-99 - [c63]Thomas Meyer:
Preferential Semantics as the Basis for Defeasible Reasoning in Ontologies. DARe@IJCAI 2015 - [c62]Richard Booth, Giovanni Casini, Thomas Andreas Meyer, Ivan José Varzinczak:
On the Entailment Problem for a Logic of Typicality. IJCAI 2015: 2805-2811 - [c61]Giovanni Casini, Thomas Andreas Meyer, Kodylan Moodley, Uli Sattler, Ivan José Varzinczak:
Introducing Defeasibility into OWL Ontologies. International Semantic Web Conference (2) 2015: 409-426 - [e1]Odile Papini, Salem Benferhat, Laurent Garcia, Marie-Laure Mugnier, Eduardo L. Fermé, Thomas Meyer, Renata Wassermann, Torsten Hahmann, Ken Baclawski, Adila Krisnadhi, Pavel Klinov, Stefano Borgo, Oliver Kutz, Daniele Porello:
Proceedings of the Joint Ontology Workshops 2015 Episode 1: The Argentine Winter of Ontology co-located with the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), Buenos Aires, Argentina, July 25-27, 2015. CEUR Workshop Proceedings 1517, CEUR-WS.org 2015 [contents] - 2014
- [j21]Gavin Rens, Thomas Meyer, Gerhard Lakemeyer:
SLAP: Specification logic of actions with probability. J. Appl. Log. 12(2): 128-150 (2014) - [c60]Szymon Klarman, Thomas Meyer:
Complexity of Temporal Query Abduction in DL-Lite. Description Logics 2014: 233-244 - [c59]Kodylan Moodley, Thomas Meyer, Uli Sattler:
DIP: A Defeasible-Inference Platform for OWL Ontologies. Description Logics 2014: 671-683 - [c58]E. A. Nasubo Ongoma, C. Maria Keet, Thomas Meyer:
Transition Constraints for Temporal Attributes. Description Logics 2014: 684-695 - [c57]Gavin Rens, Thomas Meyer, Gerhard Lakemeyer:
A Logic for Specifying Stochastic Actions and Observations. FoIKS 2014: 305-323 - [c56]Giovanni Casini, Thomas Meyer, Kodylan Moodley, Riku Nortje:
Relevant Closure: A New Form of Defeasible Reasoning for Description Logics. JELIA 2014: 92-106 - [c55]Szymon Klarman, Thomas Meyer:
Querying Temporal Databases via OWL 2 QL. RR 2014: 92-107 - [c54]Kodylan Moodley, Thomas Meyer, Uli Sattler:
Practical Defeasible Reasoning for Description Logics. STAIRS 2014: 191-200 - [i6]Richard Booth, Thomas Meyer, Ivan José Varzinczak, Renata Wassermann:
On the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic. CoRR abs/1401.3902 (2014) - 2013
- [c53]Arina Britz, Giovanni Casini, Thomas Meyer, Ivan José Varzinczak:
Preferential Role Restrictions. Description Logics 2013: 93-106 - [c52]Giovanni Casini, Thomas Meyer, Kodylan Moodley, Ivan José Varzinczak:
Towards Practical Defeasible Reasoning for Description Logics. Description Logics 2013: 587-599 - [c51]Giovanni Casini, Thomas Meyer, Ivan José Varzinczak, Kodylan Moodley:
Nonmonotonic Reasoning in Description Logics: Rational Closure for the ABox. Description Logics 2013: 600-615 - [c50]Riku Nortje, Arina Britz, Thomas Meyer:
Module-theoretic Properties of Reachability Modules for SRIQ. Description Logics 2013: 868-884 - [c49]Deshendran Moodley, Christopher J. Seebregts, Anban W. Pillay, Thomas Meyer:
An Ontology for Regulating eHealth Interoperability in Developing African Countries. FHIES 2013: 107-124 - [c48]Szymon Klarman, Thomas Meyer:
Prediction and Explanation over DL-Lite Data Streams. LPAR 2013: 536-551 - [c47]Riku Nortje, Katarina Britz, Thomas Meyer:
Reachability Modules for the Description Logic $\mathcal{SRIQ}$. LPAR 2013: 636-652 - 2012
- [j20]Alexander Ferrein, Thomas Meyer:
A Brief Overview of Artificial Intelligence in South Africa. AI Mag. 33(1): 99-103 (2012) - [j19]Richard Booth, Thomas Meyer, Chattrakul Sombattheera:
A General Family of Preferential Belief Removal Operators. J. Philos. Log. 41(4): 711-733 (2012) - [c46]Katarina Britz, Thomas Meyer, Ivan José Varzinczak:
Normal Modal Preferential Consequence. Australasian Conference on Artificial Intelligence 2012: 505-516 - [c45]Kodylan Moodley, Thomas Meyer, Ivan José Varzinczak:
A Protege Plug-in for Defeasible Reasoning. Description Logics 2012 - [c44]Richard Booth, Thomas Meyer, Ivan José Varzinczak:
PTL: A Propositional Typicality Logic. JELIA 2012: 107-119 - [c43]Giovanni Casini, Aurona Gerber, Thomas Meyer:
A note on the translation of conceptual data models into description logics: disjointness and covering assumptions. SAICSIT 2012: 10-20 - [c42]Kodylan Moodley, Thomas Meyer, Ivan José Varzinczak:
A defeasible reasoning approach for description logic ontologies. SAICSIT 2012: 69-78 - [c41]Gavin Rens, Gerhard Lakemeyer, Thomas Meyer:
A Logic for Specifying Agent Actions and Observations with Probability. STAIRS 2012: 252-263 - [i5]James P. Delgrande, Thomas Meyer, Ulrike Sattler:
Foundations and Challenges of Change and Evolution in Ontologies (Dagstuhl Seminar 12441). Dagstuhl Reports 2(10): 105-116 (2012) - 2011
- [j18]Katarina Britz, Thomas Meyer, Ivan José Varzinczak:
Preferential Reasoning for Modal Logics. Electron. Notes Theor. Comput. Sci. 278: 55-69 (2011) - [j17]Richard Booth, Thomas Andreas Meyer, Ivan José Varzinczak, Renata Wassermann:
On the Link between Partial Meet, Kernel, and Infra Contraction and its Application to Horn Logic. J. Artif. Intell. Res. 42: 31-53 (2011) - [j16]Richard Booth, Thomas Andreas Meyer:
How to Revise a Total Preorder. J. Philos. Log. 40(2): 193-238 (2011) - [c40]Katarina Britz, Thomas Meyer, Ivan José Varzinczak:
Semantic Foundation for Preferential Description Logics. Australasian Conference on Artificial Intelligence 2011: 491-500 - [c39]Arina Britz, Thomas Meyer, Ivan José Varzinczak:
Concept Model Semantics for DL Preferential Reasoning. Description Logics 2011 - [c38]Riku Nortje, Arina Britz, Thomas Andreas Meyer:
Bidirectional Reachability-Based Modules. Description Logics 2011 - [c37]Kodylan Moodley, Thomas Meyer, Ivan José Varzinczak:
Root Justifications for Ontology Repair. RR 2011: 275-280 - [i4]Richard Booth, Thomas Andreas Meyer:
Admissible and Restrained Revision. CoRR abs/1109.6344 (2011) - 2010
- [j15]Thomas Meyer, Mehmet A. Orgun:
Introduction: Special Issue on Knowledge Representation and Ontology Research. Appl. Artif. Intell. 24(1&2): 1-4 (2010) - [j14]Richard Booth, Samir Chopra, Thomas Andreas Meyer, Aditya Ghose:
Double preference relations for generalised belief change. Artif. Intell. 174(16-17): 1339-1368 (2010) - [j13]Richard Booth, Thomas Andreas Meyer:
Equilibria in social belief removal. Synth. 177(Supplement-1): 97-123 (2010) - [c36]Gavin Rens, Ivan José Varzinczak, Thomas Meyer, Alexander Ferrein:
A Logic for Reasoning about Actions and Explicit Observations. Australasian Conference on Artificial Intelligence 2010: 395-404 - [c35]Richard Booth, Thomas Andreas Meyer, Ivan José Varzinczak, Renata Wassermann:
Horn Belief Change: A Contraction Core. ECAI 2010: 1065-1066
2000 – 2009
- 2009
- [c34]Katarina Britz, Johannes Heidema, Thomas Andreas Meyer:
Modelling Object Typicality in Description Logics. Australasian Conference on Artificial Intelligence 2009: 506-516 - [c33]Katarina Britz, Johannes Heidema, Tommie Meyer:
Modelling Object Typicality in Description Logics. Description Logics 2009 - [c32]Richard Booth, Thomas Andreas Meyer, Ivan José Varzinczak:
Next Steps in Propositional Horn Contraction. IJCAI 2009: 702-707 - [c31]Richard Booth, Thomas Andreas Meyer, Chattrakul Sombattheera:
A General Family of Preferential Belief Removal Operators. LORI 2009: 42-54 - 2008
- [j12]Mehmet A. Orgun, Thomas Meyer:
Introduction to the special issue on advances in ontologies. Expert Syst. J. Knowl. Eng. 25(3): 175-178 (2008) - [j11]Samir Chopra, Aditya Ghose, Thomas Andreas Meyer, Ka-Shu Wong:
Iterated Belief Change and the Recovery Axiom. J. Philos. Log. 37(5): 501-520 (2008) - [c30]Richard Booth, Thomas Andreas Meyer:
Equilibria in Social Belief Removal. KR 2008: 145-155 - [c29]Katarina Britz, Johannes Heidema, Thomas Andreas Meyer:
Semantic Preferential Subsumption. KR 2008: 476-484 - 2007
- [j10]Louise Leenen, Thomas Andreas Meyer, Aditya Ghose:
Relaxations of semiring constraint satisfaction problems. Inf. Process. Lett. 103(5): 177-182 (2007) - [c28]Louise Leenen, Anbulagan, Thomas Meyer, Aditya K. Ghose:
Modeling and Solving Semiring Constraint Satisfaction Problems by Transformation to Weighted Semiring Max-SAT. Australian Conference on Artificial Intelligence 2007: 202-212 - [c27]Zhi Qiang Zhuang, Maurice Pagnucco, Thomas Meyer:
Implementing Iterated Belief Change Via Prime Implicates. Australian Conference on Artificial Intelligence 2007: 507-518 - [c26]Richard Booth, Thomas Andreas Meyer:
On the Dynamics of Total Preorders: Revising Abstract Interval Orders. ECSQARU 2007: 42-53 - [c25]Anne Cregan, Rolf Schwitter, Thomas Meyer:
Sydney OWL Syntax - towards a Controlled Natural Language Syntax for OWL 1.1. OWLED 2007 - 2006
- [j9]Samir Chopra, Aditya K. Ghose, Thomas Andreas Meyer:
Social choice theory, belief merging, and strategy-proofness. Inf. Fusion 7(1): 61-79 (2006) - [j8]Richard Booth, Thomas Andreas Meyer:
Admissible and Restrained Revision. J. Artif. Intell. Res. 26: 127-151 (2006) - [c24]Thomas Andreas Meyer, Kevin Lee, Richard Booth, Jeff Z. Pan:
Finding Maximally Satisfiable Terminologies for the Description Logic ALC. AAAI 2006: 269-274 - [c23]Laurent Perrussel, Jean-Marc Thévenin, Thomas Andreas Meyer:
Mutual enrichment through nested belief change. AAMAS 2006: 226-228 - [c22]Kevin Lee, Thomas Andreas Meyer, Jeff Z. Pan, Richard Booth:
Computing Maximally Satisfiable Terminologies for the Description Logic ALC with Cyclic Definitions. Description Logics 2006 - [c21]Laurent Perrussel, Jean-Marc Thévenin, Thomas Meyer:
Mutual Enrichment for Agents Through Nested Belief Change: A Semantic Approach. ECAI 2006: 731-732 - [c20]Richard Booth, Thomas Andreas Meyer, Ka-Shu Wong:
A Bad Day Surfing Is Better than a Good Day Working: How to Revise a Total Preorder. KR 2006: 230-238 - [c19]Louise Leenen, Thomas Andreas Meyer, Peter Harvey, Aditya Ghose:
A Relaxation of a Semiring Constraint Satisfaction Problem Using Combined Semirings. PRICAI 2006: 907-911 - 2005
- [j7]Richard Booth, Samir Chopra, Aditya Ghose, Thomas Andreas Meyer:
Belief Liberation (and Retraction). Stud Logica 79(1): 47-72 (2005) - [c18]Thomas Andreas Meyer, Kevin Lee, Richard Booth:
Knowledge Integration for Description Logics. AAAI 2005: 645-650 - [c17]Thomas Andreas Meyer, Pilar Pozos Parra, Laurent Perrussel:
Mediation Using m-States. ECSQARU 2005: 489-500 - 2004
- [c16]Thomas Andreas Meyer, Norman Y. Foo, Rex Kwok, Dongmo Zhang:
Logical Foundations of Negotiation: Outcome, Concession, and Adaptation. AAAI 2004: 293-298 - [c15]Dongmo Zhang, Norman Y. Foo, Thomas Andreas Meyer, Rex Kwok:
Negotiation as Mutual Belief Revision. AAAI 2004: 317-323 - [c14]Norman Y. Foo, Thomas Meyer, Gerhard Brewka:
LPOD Answer Sets and Nash Equilibria. ASIAN 2004: 343-351 - [c13]Kevin Lee, Thomas Andreas Meyer:
A Classification of Ontology Modification. Australian Conference on Artificial Intelligence 2004: 248-258 - [c12]Richard Booth, Samir Chopra, Thomas Andreas Meyer, Aditya Ghose:
A Unifying Semantics for Belief Change. ECAI 2004: 793-797 - [c11]Thomas Andreas Meyer, Norman Y. Foo, Rex Kwok, Dongmo Zhang:
Logical Foundations of Negotiation: Strategies and Preferences. KR 2004: 311-318 - [c10]Richard Booth, Samir Chopra, Thomas Andreas Meyer, Aditya Ghose:
A unifying semantics for belief change. NMR 2004: 72-78 - 2003
- [j6]Samir Chopra, Aditya Ghose, Thomas Meyer:
Non-Prioritized Ranked Belief Change. J. Philos. Log. 32(4): 417-443 (2003) - [c9]Samir Chopra, Johannes Heidema, Thomas Andreas Meyer:
Some Logics of Belief and Disbelief. Australian Conference on Artificial Intelligence 2003: 364-376 - [c8]Richard Booth, Samir Chopra, Aditya Ghose, Thomas Andreas Meyer:
Belief liberation (and retraction). TARK 2003: 159-172 - 2002
- [j5]Thomas Andreas Meyer, Johannes Heidema, Willem Adrian Labuschagne, Louise Leenen:
Systematic Withdrawal. J. Philos. Log. 31(5): 415-443 (2002) - [c7]Samir Chopra, Aditya Ghose, Thomas Andreas Meyer:
Iterated revision and the axiom of recovery: A unified treatment via epistemic states. ECAI 2002: 541-545 - [c6]Samir Chopra, Johannes Heidema, Thomas Andreas Meyer:
Some logics of belief and disbelief. NMR 2002: 25-32 - [c5]Samir Chopra, Aditya Ghose, Thomas Andreas Meyer:
Iterated revision and the axiom of recovery: a unified treatment via epistemic states. NMR 2002: 117-123 - [c4]Thomas Andreas Meyer, Aditya Ghose, Samir Chopra:
Syntactic Representations of Semantic Merging Operations. PRICAI 2002: 620 - [i3]Samir Chopra, Johannes Heidema, Thomas Andreas Meyer:
Some logics of belief and disbelief. CoRR cs.AI/0207037 (2002) - [i2]Samir Chopra, Aditya Ghose, Thomas Andreas Meyer:
Iterated revision and the axiom of recovery: a unified treatment via epistemic states. CoRR cs.AI/0207038 (2002) - 2001
- [j4]Thomas Andreas Meyer:
On the semantics of combination operations. J. Appl. Non Class. Logics 11(1-2): 59-84 (2001) - [j3]Thomas Andreas Meyer:
Basic Infobase Change. Stud Logica 67(2): 215-242 (2001) - [c3]Thomas Andreas Meyer, Aditya Ghose, Samir Chopra:
Social Choice, Merging, and Elections. ECSQARU 2001: 466-477 - 2000
- [j2]Thomas Andreas Meyer, Willem Adrian Labuschagne, Johannes Heidema:
Refined Epistemic Entrenchment. J. Log. Lang. Inf. 9(2): 237-259 (2000) - [j1]Thomas Andreas Meyer, Willem Adrian Labuschagne, Johannes Heidema:
Infobase Change: A First Approximation. J. Log. Lang. Inf. 9(3): 353-377 (2000) - [c2]Thomas Andreas Meyer:
Merging Epistemic States. PRICAI 2000: 286-296 - [i1]Thomas Andreas Meyer:
On the semantics of merging. CoRR cs.AI/0003015 (2000)
1990 – 1999
- 1999
- [c1]Thomas Andreas Meyer:
Basic Infobase Change. Australian Joint Conference on Artificial Intelligence 1999: 156-167