19 found
Order:
See also
Konstantinos Georgatos
City University of New York
  1.  25
    Relevance Sensitive Non-Monotonic Inference on Belief Sequences.Samir Chopra, Konstantinos Georgatos & Rohit Parikh - 2001 - Journal of Applied Non-Classical Logics 11 (1-2):131-150.
    We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the putative conclusion and formulas in the sequence. The relevance relations are ternary (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  2.  70
    Resolution Spaces: A Topological Approach to Similarity.Konstantinos Georgatos - 2000 - In DEXA 2000. IEEE Computer Society. pp. 553-557.
    A central concept for information retrieval is that of similarity. Although an information retrieval system is expected to return a set of documents most relevant to the query word(s), it is often described as returning a set of documents most similar to the query. The authors argue that in order to reason with similarity we need to model the concept of discriminating power. They offer a simple topological notion called resolution space that provides a rich mathematical framework for reasoning with (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography  
  3.  18
    Updating Knowledge Using Subsets.Konstantinos Georgatos - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):427-441.
    Larry Moss and Rohit Parikh used subset semantics to characterize a family of logics for reasoning about knowledge. An important feature of their framework is that subsets always decrease based on the assumption that knowledge always increases. We drop this assumption and modify the semantics to account for logics of knowledge that handle arbitrary changes, that is, changes that do not necessarily result in knowledge increase, such as the update of our knowledge due to an action. We present a system (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  4.  30
    Knowledge on Treelike Spaces.Konstantinos Georgatos - 1997 - Studia Logica 59 (2):271-301.
    This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisitions. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are tree-like spaces which are a generalization of semantics used for modeling branching time and historical necessity. A finite system of axiom schemes is shown to be canonically complete for the formentioned spaces. A characterization of the satisfaction relation implies the small model property and decidability for this system.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  5.  22
    Conditioning by Minimizing Accessibility.Konstantinos Georgatos - 2010 - In Giacomo Bonanno, Benedikt Löwe & Wiebe Hoek (eds.), Logic and the Foundations of Game and Decision Theory €“ Loft 8. Springer Berlin Heidelberg. pp. 20-33.
    This paper presents an axiomatization of a class of set-theoretic conditional operators using minimization of the geodesic distance defined as the shortest path generated by the accessibility relation on a frame. The objective of this modeling is to define conditioning based on a notion of similarity generated by degrees of indistinguishability.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  6.  26
    Ordering-Based Representations of Rational Inference.Konstantinos Georgatos - 1996 - In Jose Julio Alferes, Luis Moniz Pereira & Ewa Orlowska (eds.), JELIA 96. Springer. pp. 176-191.
    Rational inference relations were introduced by Lehmann and Magidor as the ideal systems for drawing conclusions from a conditional base. However, there has been no simple characterization of these relations, other than its original representation by preferential models. In this paper, we shall characterize them with a class of total preorders of formulas by improving and extending G ̈ardenfors and Makinson’s results f or expectation inference relations. A second representation is application-oriented and is obtained by considering a class of consequence (...)
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography   1 citation  
  7.  23
    Modal Logics for Topological Spaces.Konstantinos Georgatos - 1993 - Dissertation, City University of New York
    In this thesis we present two logical systems, $\bf MP$ and $\MP$, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and effort will be defined by concrete mathematical concepts.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  8.  11
    Entrenchment Relations: A Uniform Approach to Nonmonotonic Inference.Konstantinos Georgatos - 1997 - In D. Gabbay, R. Kruse, A. Nonnengart & H. J. Ohlbach (eds.), ESCQARU/FAPR 97. Springer. pp. 282--297.
    We show that Gabbay’s nonmonotonic consequence relations c an be reduced to a new family of relations, called entrenchment relations. Entrenchment relations provide a direct generalization of epistemic entrenchment and expectation ordering introduced by G ̈ardenfors and Makinson for the study of belief revision and expectation inference, respectively.
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography   1 citation  
  9. Knowledge Theoretic Properties of Topological Spaces.Konstantinos Georgatos - 1994 - In Masuch, Michael & Polos Laszlo (eds.), Knowledge Representation and Uncertainty. Springer Verlag. pp. 147--159.
    We study the topological models of a logic of knowledge for topological reasoning, introduced by Larry Moss and Rohit Parikh (1992). Among our results is the confirmation of a conjecture by Moss and Parikh, as well as the finite satisfiability property and decidability for the theory of topological models.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  10.  17
    Belief Update Using Graphs.Konstantinos Georgatos - 2008 - In David Wilson & Chad H. Lane (eds.), FLAIRS 21. AAAI Press. pp. 649-654.
    The purpose of this paper is to introduce a form of update based on the minimization of the geodesic distance on a graph. We provide a characterization of this class using set- theoretic operators and show that such operators bijectively correspond to geodesic metrics. As distance is generated by distinguishability, our framework is appropriate in contexts where distance is generated by threshold, and therefore, when measurement is erroneous.
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography  
  11.  3
    Geodesic Merging.Konstantinos Georgatos - forthcoming - Synthese:1-22.
    We pursue an account of merging through the use of geodesic semantics, the semantics based on the length of the shortest path on a graph. This approach has been fruitful in other areas of belief change such as revision and update. To this end, we introduce three binary merging operators of propositions defined on the graph of their valuations and we characterize them with a finite set of postulates.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12.  3
    Graph-Based Belief Merging.Konstantinos Georgatos - 2016 - In Wiebe van der Hoek, Wesley H. Holliday & Wen-Fang Wang (eds.), Logic, Rationality, and Interaction. Berlin Heidelberg: Springer-Verlag. pp. 101-115.
    Graphs are employed to define a variety of distance-based binary merging operators. We provide logical characterization results for each class of merging operators introduced and discuss the extension of this approach to the merging of sequences and multisets.
    Direct download  
     
    Export citation  
     
    My bibliography  
  13.  7
    To Preference Via Entrenchment.Konstantinos Georgatos - 1999 - Annals of Pure and Applied Logic 96 (1--3):141--155.
    We introduce a simple generalization of Gardenfors and Makinson’s epistemic entrenchment called partial entrenchment. We show that preferential inference can be generated as the sceptical counterpart of an inference mechanism defined directly on partial entrenchment.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  14.  7
    Iterated Contraction Based on Indistinguishability.Konstantinos Georgatos - 2013 - In Sergei Artemov & Anil Nerode (eds.), LFCS 2013. Springer. pp. 194–205.
    We introduce a class of set-theoretic operators on a tolerance space that models the process of minimal belief contraction, and therefore a natural process of iterated contraction can be defined. We characterize the class of contraction operators and study the properties of the associated iterated belief contraction.
    Direct download  
    Translate
     
     
    Export citation  
     
    My bibliography  
  15.  3
    On Indistinguishability and Prototypes.Konstantinos Georgatos - 2003 - Logic Journal of the IGPL 11 (5):531-545.
    Tolerance spaces are sets equipped with a reflexive, symmetric, but not necessarily transitive, relation of indistinguishability, and are useful for describing vagueness based on error-prone measurements. We show that any tolerance space can be embedded in one generated by comparisons using prototypical objects. As a result propositions, definable on a tolerance space can be translated into propositions behaving classically.
    Direct download  
     
    Export citation  
     
    My bibliography  
  16.  2
    Geodesic Revision.Konstantinos Georgatos - 2009 - Journal of Logic and Computation 19 (3):447-459.
    The purpose of this article is to introduce a class of distance-based iterated revision operators generated by minimizing the geodesic distance on a graph. Such operators correspond bijectively to metrics and have a simple finite presentation. As distance is generated by distinguishability, our framework is appropriate for modelling contexts where distance is generated by threshold, and therefore, when measurement is erroneous.
    Direct download  
     
    Export citation  
     
    My bibliography  
  17.  2
    Preface.Melvin Fitting, Konstantinos Georgatos & R. Ramanujam - 1999 - Annals of Pure and Applied Logic 96 (1-3):1.
    Preface of Festschrift on the occasion of Professor Rohit Parikh's 60th birthday.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  18. ESCQARU/FAPR 97.Konstantinos Georgatos - 1997
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography  
  19. JELIA 96.Konstantinos Georgatos - 1996 - Springer.
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography