37 citations found. Retrieving documents...
Barwise, J., and Etchemendy, J. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, 1987.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Computational Situation Theory - Tin, Akman (1994)   (Correct)

.... philosophy, and the mind [10] It was first formulated in detail by Jon Barwise and John Perry in 1983 [11] and has matured over the last decade [24] Various versions of the theory have been applied to a number of linguistic issues, resulting in what is commonly known as situation semantics [7, 8, 9, 23, 29, 31, 33, 48]. The latter aims at the construction of a unified and mathematically rigorous theory of meaning, and the application of such a theory to natural languages. Department of Computer Engineering and Information Science, Faculty of Engineering, Bilkent, 06533 Ankara, Turkey. E mail: ftin, ....

....and Information Science, Faculty of Engineering, Bilkent, 06533 Ankara, Turkey. E mail: ftin, akmang bilkent.edu.tr or ftin, akmang trbilun.bitnet. Fax: 90 4 2664126. Mathematical and logical issues that arise within situation theory and situation semantics have been explored in numerous works [8, 9, 11, 23, 24, 31]. In the past, the development of a mathematical situation theory has been held back by a lack of availability of appropriate technical tools. But by now, the theory has assembled its mathematical foundations based on intuitions basically coming from set theory and logic [1, 8, 23, 25] With a ....

[Article contains additional citation context not shown here]

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity, New York, N.Y.: Oxford University Press, 1987.


On the Foundations of Final Semantics: Non-Standard Sets.. - Rutten, Turi (1998)   (1 citation)  (Correct)

....on maps) Notice that it simply generalizes (4) to any function on X . One final remark. Here, the definition of the expanded universe is carried out within the language of set theory, but, alternatively, indeterminates could also be added as new symbols in the language. For instance, in [BE88] indeterminates are indeed treated as primitive elements (Urelemente) of a set theory like the one in [Bar75] But in order to carry out this extension of the language formally, an extension of the axioms of the theory is also required. 4.4 Special Final Coalgebra Theorem The assumption that the ....

J. Barwise and J. Etchemendy. The Liar: An Essay in Truth and Circularity. Oxford University Press, 1988.


From Set to Hyperset Unification - Aliffi, Dovier, Rossi (1999)   (Correct)

.... give a set theoretic mathematical model of concurrent processes (see [1] for the history of hypersets) Afterwards, interesting applications have been given by Barwise to the semantics of natural languages, and in particular to the semantics of languages containing a truth predicate (see [6] and [7]) where non well founded sets allow one to take into account the classical paradox of the liar. The mathematical concept of set has two di erent aspects. On one hand, there is the idea that sets are built by means of the iterated application of the operation of insertion of an element (the with ....

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, 1987.


Parametric Corecursion - Moss   (7 citations)  (Correct)

....Lemma Before turning to our main results, we present a very general fact which lies at the heart of most of the results of this paper. It is a reformulation of the flattening technique which originated in the study of non wellfounded sets, in the books of Aczel [1] and Barwise and Etchemendy [2]. In this paper, C denotes a category with a designated coproduct operation , and F : C C is an endofunctor. If a and b are objects of C, then we have injections inl : a a b and inr : b a b. When we use subscripts on these injections, we have in mind a special meaning that we introduce ....

Jon Barwise and John Etchemendy, The Liar: An Essay in Truth and Circularity. Oxford University Press, 1987.


A Situation Semantic Account of Topic vs. Nominative Marking - Kim   (Correct)

.... is of type [ T ] 14) is a special case where the type is an infon and the argument is a situation, and such propositions are called Austinian propositions, contrasted to Russellian propositions in which the type is a type, i.e. a proposition abstract and the argument is an assignment term (Barwise and Etchemendy 1987). A parameter term 4 instead of a constant term can be used in any situation theoretic objects. For instance, when a parameter X occupies an argument position of a relation, as in (16) we call such an infon a parametric infon and a proposition containing it a parametric proposition. We can ....

Barwise, Jon, and John Etchemendy. 1987. The Liar: An Essay on Truth and Circularity. New York: Oxford University Press.


Information Articulation and Truth Conditions of Existential.. - Kim (1998)   (Correct)

....T , where A is an assignment term and T is a type term. 16) denotes the proposition that [ A] is of type [ T ] 15) is a special case where the type is an infon and the argument is a situation, and such propositions are called Austinian propositions, contrasted to Russellian propositions (Barwise and Etchemendy 1987). Information Articulation andTruth Conditions ofExistential Sentences 9 A parameter term instead of a constant term can be used in any situation theoretic objects. For instance, when a parameter X occupies an argument position of a relation, as in (17) we call such a proposition a parametric ....

Barwise, Jon, and John Etchemendy. 1987. The Liar: An Essay on Truth and Circularity. New York: Oxford University Press.


A Variant of Thomason's First-order Logic CF Based On Situations - Wang, Mott (1997)   (Correct)

....refute oe, then it rejects the claim that oe is refuted by s and thereby establishes U oe. For the same reason, U oe is not persistent either. The distinction between strong negation and U is similar to Barwise and Etchemendy s distinction between negation and denial(see Barwise and Etchemendy [6]) However, our approach is radically different from Barwise and Etchemendy s. Among other things, the inclusion of U in our logic will lead us into non monotonic logic whereas Barwise and Etchemendy claim that Closing the class of propositions under conjunction, disjunction, 8 Readers are ....

Barwise, J., and Etchemendy, J., The Liar: An Essay on Truth and Circularity. New York: Oxford University Press, 1987.


The Logic of Correct Description - Seligman (1995)   (17 citations)  (Correct)

....by way of examples of natural reasoning using spatial indexicals. Finally, a Gentzen style sequent calculus is o ered. Keywords: Austin, truth, correct description, situation, indexical, natural deduction, sequent calculus. 1 Truth and Correct Description A basic tenet of situation semantics ([BP83, BE87, Bar89]) deriving from Austin s theory of truth ( Aus50] is that every statement is about a situation. To make a statement by uttering the sentence Michel tossed the salad, I must also be referring to a speci c situation in this case, an event which, if my statement is true, is one in which Michel ....

J. Barwise and J. Etchemendy. The Liar: An Essay in Truth and Circularity. Basil Blackwell, Oxford, 1987.


Recursive Subtyping Revealed - Gapeyev, Levin, Pierce (2000)   (7 citations)  (Correct)

....expositionary article on the use of coinduction in relational semantics [16] The latter appears to have the first mention of the term coinduction in computer science literature. The earliest known to us appearance of the term in the literature in general is Barwise and Etchemendy s The Liar [4]. However, the mathematical developments laying foundation for coinduction are older, see Aczel s book [2] on non wellfounded sets, which also has a brief historical survey. In computer science, the most promininent early use of essentially coinductive methods is Milner s work on concurrency [14] ....

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, 1995.


Representing Beliefs in a Situated Event Calculus - Lévy, Quantz (1997)   (1 citation)  (Correct)

....an extension of the event calculus [KS86] which allows the representation of alternative situations (states of affairs) and beliefs. The basic idea of this situated event calculus is to use the notion of situations as developed in Situation Semantics, a linguistically motivated semantic theory [BP83, BE87] . Instead of having events of the form Happens(Action,Time) all events occur relative to a specific situation: Happens(Action,Time,Sit) In other words, an event can happen in one situation and not happen in an otherwise similar situation. Situations can thus be viewed as collections of ....

Barwise (J.) et Etchemendy (J.). -- The Liar: an Essay on Truth and Circularity. -- Oxford University Press, 1987.


Representations as Processes: Situation-theoretic Objects.. - Fujinami   (Correct)

....of non well founded set theory [2] which forms a basis of Situation Theory, is to define a semantics for Synchronous Calculus of Communicating Systems(SCCS) 11] an ancestor of the calculus. Therefore, it should not be so difficult to implement an earlier version of Situation Semantics [7] using SCCS. But we are interested in here exploring the power of the calculus to implement a more recent version of Situation Theory [5, 6] Another intention of the encoding is to look for a computational model for Situation Theory, where computational means that it must be computable and be ....

Barwise, J. and J. Etchemendy (1987) The Liar: An Essay on Truth and Circularity . Oxford University Press.


Issues in Commonsense Set Theory - Pakkan, Akman (1992)   (1 citation)  (Correct)

....The classical extensionality paradigm, that sets are equal if and only if they have the same members, works fine with well founded sets. However, this is not of use in deciding the equality of say, a = f1; ag and b = f1; bg because it just asserts that a = b if and only if a = b, a triviality (Barwise Etchemendy 1987). However, in the universe of hypersets, a is indeed equal to b since they are depicted by the same graph. To see this, consider a graph G and a decoration D assigning a to a node x of G, i.e. D(x) a. Now consider the decoration D 0 exactly the same as D except that D 0 (x) b. D 0 must ....

....The AFA universe can be depicted as in Figure 9, extending around the well founded universe, because it includes the non well founded sets which are not covered by the latter. universe A F A well founded universe Figure 9: AFA universe extending around the well founded universe (adapted from (Barwise Etchemendy 1987)) 3.2.1 Equations in the AFA Universe Aczel s theory includes another important useful feature: solving equations in the universe of Hypersets. Let VA be the universe of hypersets with atoms from a given set A and let V A 0 be the universe of hypersets with atoms from another given set A 0 ....

[Article contains additional citation context not shown here]

Barwise, J. and Etchemendy, J. (1987). The Liar: An Essay on Truth and Circularity .


Nonstandard Set Theories and Information Management - Akman, Pakkan (1994)   (Correct)

....is the set of atoms in each X set a x of an equation x = a x . In the above example, g(x) fyg, g(y) fzg, g(z) fxg, and h(x) fCg, h(y) fCg, h(z) fMg, and one can compute the solution f(x) fC; fC; fM;xggg; f(y) fC; fM; fC; yggg; f(z) fM; fC; fC; zggg: As another example due to (Barwise Etchemendy, 1987), it may be verified that the system of equations x = fC; M; yg; y = fM; xg; z = fx; yg: has a unique solution in the universe of Hypersets depicted in Figure 8 with x = a, y = b, and z = c. This technique of solving equations in the universe of hypersets can be useful in modeling information ....

....b is a function on the domain of a satisfying b(x) M(a(x) ffl if s is a situation, then M(s) fM(oe) s j= oeg. Using this operation, Barwise proves that there is no largest situation (corresponding to the absence of a universal set in ZF) We also see a treatment of self reference in (Barwise Etchemendy, 1987), where the authors concentrate on the concept of truth. In this study, two conceptions of truth are examined, primarily on the basis of the notorious Liar Paradox 13 . The authors make use of Aczel s theory for this purpose. A statement like This sentence is not expressible in English in ten ....

[Article contains additional citation context not shown here]

Barwise, J. and Etchemendy, J. (1987). The Liar: An Essay on Truth and Circularity , Oxford University Press, New York.


Steps Toward Formalizing Context - Akman, Surav (1996)   (35 citations)  (Correct)

....= in(A; RW) ffl Knowledge: Attardi and Simi view knowledge as true belief: K(g; A) Bel(g; A) True(A) Clearly, all the properties usually ascribed to knowledge can be derived, e.g. K(g; A) A. ffl Situations a la Barwise Perry: Attardi and Simi take situations as sets of basic facts [11], and use an approach similar to that of belief. Thus, they define a basic relation Holds(A; s) in(A; vp(s) where vp(s) is the set of facts holding in a situation s. See the next section for more information on situations. Shoham on Contexts Shoham [56] uses the alternative notation p c ....

....be described by s j= hugs; Bob; Carol; l; t; 1 AE where l and t together give the spatio temporal coordinates of this hugging action. Abstract situations are the constructs which are more amenable to mathematical manipulation. An abstract situation is defined as a (possibly non well founded [11]) set of infons. Given a real situation s, the set fff j s j= ffg is the corresponding abstract situation. One of the important ideas behind Situation Theory is a scheme of individuation, a way of carving the world into uniformities. Being constructs that link the scheme of individuation to the ....

[Article contains additional citation context not shown here]

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, 1987.


Situated Modeling of Epistemic Puzzles - Ersan, Akman (1995)   (1 citation)  (Correct)

....by sit1, i.e. sit1 becomes a subtype of sit2. The subsituation relation, denoted by ( sit1 sit2) is the same as ( sit1 sit2) except that only infons, but no constraints, are inherited. Both relations are transitive. A distinguishing feature of PROSIT is that the language allows circularity [6]. The fact that PROSIT permits situations as arguments to infons makes it possible to write self referential statements. Consider a card game (sit) between two players. John has the ace of spades and Mary has the queen of spades. When both players display their cards the following infons will be ....

..... The primary question to be answered in these epistemic puzzles is generally about the facts that the agents are aware of. So a puzzle might ask if an agent, say x, is aware of the fact f i , i.e. whether f i 2 K x is true. However, this representation fails to handle two main issues of knowledge[3, 6]: the circularity of knowledge (i.e. if a knows f 3 , then he knows that he knows f 3 , ad infinitum) and deductive omniscience (i.e. if a knows that p and p entails q, then a knows that q) For this representation to handle circularity of knowledge it should be extended such that each K i is ....

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, 1987.


On Russellian Propositions - Hirata   (Correct)

....Propositions Kouichi Hirata Department of Information Systems, Kyushu University 39, Kasuga, Fukuoka 816, Japan E mail: hirata rifis.sci.kyushu u.ac.jp Abstract This paper discusses some structural conditions under which Russellian propositions in the sense of J. Barwise and J. Etchemendy [2] are paradoxical, and the computational complexity of the problems whether or not Russellian proposition is paradoxical, intrinsically paradoxical, and classical. 1 Introduction In situation theory, there are at least two kinds of the propositions to be considered ( 2] 3] Austinian ....

....J. Barwise and J. Etchemendy [2] are paradoxical, and the computational complexity of the problems whether or not Russellian proposition is paradoxical, intrinsically paradoxical, and classical. 1 Introduction In situation theory, there are at least two kinds of the propositions to be considered ([2], 3] Austinian propositions and Russellian propositions. An Austinian proposition is true if the situation about the proposition is of the type. By contrast, a Russellian proposition is true if there is a situation such that the proposition is of the type. In general, a Russellian proposition ....

[Article contains additional citation context not shown here]

J. Barwise and J. Etchemendy. The Liar -- An Essay on Truth and Circularity. Oxford University Press, 1987.


Axiomatic Set Theories And Common Sense - Surav, Akman (1994)   (Correct)

....mechanism depends on the person (his personal cognitive capabilities) and the situation in which this categorization occurs. Technically speaking, if we are to construct a commonsense set theory, we have to consider the situations (thus situation theory and situation semantics (STASS) [4, 5, 6], and define the axioms of our system to be somewhat compatible with the axioms of STASS. However, the axioms of a commonsense set theory cannot be totally independent of the classical (axiomatic) set theory [2, 26] the development of the classical theory sheds considerable light into our ....

....and adding the AFA would result in Hyperset theory (also known as ZFC Gamma AFA) What is advantageous with the new theory is that since graphs of arbitrary form are allowed including the ones containing proper cycles we can represent self referring sets. This issue is further discussed in [1, 5, 7, 8, 23, 24, 25]. Choice. 8t[8x[x 2 t 9z(z 2 x) 8y(y 2 t : y = x) 9z(z 2 x z 2 y) 9u8x(x 2 t 9w8v[v = w (v 2 u v 2 x) The meaning of the axiom is that, if t is a disjointed set which does not contain the , its outer product Pit is different from . In other words, among all subsets of [t ....

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity . Oxford University Press, New York, 1987.


Capita Selecta in Natural Language Semantics - van Eijck   (Correct)

....Expression (65) give the translation for the pronoun he 1 that has the desired effect; P is again a variable of type (s; s; e; t) P ij:P (v 1 i; i; j) 65) The translation of the whole discourse (60) is left to the reader. A pioneer paper on dynamic interpretation of natural language is Barwise (1987). Groenendijk Stokhof (1990) and Muskens (1990) contain worked out proposals. The article DYNAMIC INTERPRETATION also provides further information. Bibliography Barwise J 1981 Scenes and Other Situations , The Journal of Philosophy, 78, 369 397. Barwise J 1987 Noun Phrases, Generalized ....

....of natural language is Barwise (1987) Groenendijk Stokhof (1990) and Muskens (1990) contain worked out proposals. The article DYNAMIC INTERPRETATION also provides further information. Bibliography Barwise J 1981 Scenes and Other Situations , The Journal of Philosophy, 78, 369 397. Barwise J 1987 Noun Phrases, Generalized Quantifiers and Anaphora , in P Gardenfors (ed. Generalized Quantifiers Linguistic and Logical Approaches, 1 29, Reidel, Dordrecht. Barwise J R Cooper 1981 Generalized Quantifiers and Natural Language , Linguistics and Philosophy, 4, 159 219. Church A 1940 A ....

[Article contains additional citation context not shown here]

Barwise J & J Etchemendy 1987 The Liar: An Essay on Truth and Circularity, Oxford University Press, New York & Oxford.


A Variant of Thomason's First-order Logic CF Based on Situations - Wang, Mott (1998)   (Correct)

....oe, then it rejects the claim that oe is refuted by s and thereby establishes U oe. For the same reason, U oe is not persistent either. The distinction between strong negation and U is similar to Barwise and Etchemendy s distinction between negation and denial(see Barwise and Etchemendy [6]) However, our approach is radically different from Barwise and Etchemendy s. Among other things, the inclusion of U in our logic will lead us into non monotonic logic whereas Barwise and Etchemendy claim that Closing the class of propositions under conjunction, disjunction, and denial would ....

....other things, the inclusion of U in our logic will lead us into non monotonic logic whereas Barwise and Etchemendy claim that Closing the class of propositions under conjunction, disjunction, and denial would result in a notion of proposition whose logic is entirely classical. see p. 169 of [6]) Full details of such an extension remain to be done. In addition to the foundational role for situation theory, CF 0 may have potential applications in database theory. In database theory, we are con22 cerned with what information we can get from a query to a database. Since data in ....

Barwise, J., and Etchemendy, J., The Liar: An Essay on Truth and Circularity, Oxford University Press, New York, 1987.


Set Descriptions for Logic Programming - Carpenter   (Correct)

....applies to one object. Note that nothing prevents a set description from being circular; descriptions such as: x 9x 1 1 (3) could be used to describe the set Omega Gamma which has itself as its only element (see [Aczel 1988] for the most closely related theory of non well founded sets afa, and [Barwise and Etchemendy 1987] for a linguistic application of afa involving the liar s paradox) This interpretation of sets as not necessarily well founded follows Pollard and Moshier [1990] who provide linguistic motivation, and Rounds [1991] who provides motivation from databases. Note that our logic allows ....

Barwise, J., and Etchemendy, J. (1987). The Liar: An Essay in Truth and Circularity.


On Knowledge, Strings, and Paradoxes - Kerber (1998)   (Correct)

....on the meta level, that is, implication introduction (from lines 1 and 4) and forall introduction (from line 5) 1 An alternative to totally forbidding self reference is restricting it, e.g. restrict expression like fx j x = 2 xg to fx 2 A j x = 2 xg. This approach is discussed in detail in [1]. 2 Actually the systems are extended to allow different meta levels, in particular a meta meta level and so on. Self referentiality is not possible, the meta system speaks about the object system, but never about itself. Tarski s definition of truth is built in the reflection rules (R up ,R ....

Jon Barwise and John Etchemendy. The Liar -- An Essay on Truth and Circularity. Oxford University Press, New York, Oxford, 1986.


Inheritance Reasoning: Psychological Plausibility, Proof Theory.. - Vogel (1995)   (Correct)

.... as did the proof theories addressed, that nets are acyclic) since channel theory has been used as a general theory of information flow to characterize what is happening in situation semantics (Barwise, 1993) and situation semantics has been given applications in other puzzles of circularity (Barwise Etchemendy, 1987). This would be extremely useful since the proof theory of inheritance has not fully addressed circularity since no intuitive semantic interpretations have been available. Clearly, however, this chapter represents only the start of a proper analysis of the semantics of inheritance reasoning. The ....

Barwise, J. & Etchemendy, J. (1987). The Liar: An Essay on Truth and Circularity.


Defaults Denied - Michael Miller (1994)   (Correct)

....suppose we are given the trend axiom: T rend(bird; f ly) Then from 6.9 it follows that 8x(x 2 fx j Bird(x)g , x 2 fx j F ly(x)g) 34 Introducing 2 into the language, together with schema (6.8) brings with it the possibility of paradoxes. There are many proposals for dealing with this, e.g. [27, 11, 2]. Here we opt for a very conservative solution to the problem: we suppose an original language L that does not contain the predicate symbols 2 or T rend. We then extend this with set constants fx j OE(x)g for each formula OE(x) in L, as well as with the two symbols 2 and T rend. We employ the ....

J. Barwise and J. Etchemendy. The Liar: An essay on truth and circularity. Oxford University Press, 1987.


Issues of Semantics in a Semantic-Network Representation of Belief - Hill (1994)   (1 citation)  (Correct)

....ZFC Gamma AFA, where ZFC Gamma is ZFC without the Axiom of Foundation. By Mostowski s Collapsing Lemma, every well founded graph has a unique decoration, with every childless node assigned the empty set and the same heredity property used to determine the sets that decorate parent nodes [Barwise and Etchemendy, 1987, page 41] The introductory examples given using elements of the natural numbers N are illustrations. Here are some examples of non well founded sets. The picture below represents the set x such that x = fxg, to which Aczel gives the special name Omega Gamma Note that writing down its contents in ....

....it is its own child, the solitary node would have to be decorated with something like this: fff: ggg. If only, as Aczel says, that expression had an independently determined meaning [Aczel, 1988, page 7] Lacking that, its decoration is a set defined to be a set equal to its own singleton [Barwise and Etchemendy, 1987, page 37] still awkward. Indeed, that is the advantage of the picture representation. It obviates the need for distracting and arbitrary names. Even the name Omega is unnecessary, of course, but useful, much like node labels in SNePS. The set Omega is the completely circular hereditary set; it ....

[Article contains additional citation context not shown here]

Jon Barwise and John Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, New York, 1987.


HYPERSOLVER: A Graphical Tool for Commonsense Set Theory - Pakkan, Akman (1996)   (Correct)

....been neglected by the practicing mathematician since the classical well founded universe was a satisfying domain for his practical concerns. However, non well founded sets are useful in modeling various phenomena in computer science, viz. concurrency, databases, artificial intelligence (AI) etc. [8]. McCarthy stressed the feasibility of using set theory in AI and invited researchers to concentrate on the subject in a 1985 speech [9] Circularity is an often exploited property in various fields of AI, e.g. commonsense reasoning. Rehearsing an example of Perlis [10] if non profit ....

....uses a graphical representation for sets and thereby allows the representation of non well founded sets. A program, called HYPERSOLVER, which can solve systems of equations defined in terms of sets in the universe of this new theory is presented. 2 HYPERSET THEORY In this section we offer, using [8] and [13] a brief review of Hyperset Theory which is an enrichment of the classical ZFC set theory. It is the collection of all the conventional axioms of ZFC modified to be consistent with the new universe involving atoms, except that the FA is now replaced by the AFA (to be explained in the ....

[Article contains additional citation context not shown here]

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, 1987.


Contexts, Oracles, and Relevance - Surav, Akman (1995)   (Correct)

....that determine which particular groups of argument roles need to be filled in order to produce an infon. If m n, the infon is said to be unsaturated ; if m = n it is saturated . More information on Situation Theory can be found in Barwise and Perry [6] Barwise [4] Barwise and Etchemendy [5], and Devlin [12, 14, 15] the most up to date version of the theory) 3 Oracles as Situations In this paper, we shall mainly deal with the philosophy behind the nature of information and the ways of gathering relevant information, rather than the purely mathematical and technical issues. Thus, ....

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, NY, 1987.


Situated Modeling of Epistemic Puzzles - Ersan, Akman (1995)   (1 citation)  (Correct)

....by sit1, i.e. sit1 becomes a subtype of sit2. The subsituation relation, denoted by ( sit1 sit2) is the same as ( sit1 sit2) except that only infons, but no constraints, are inherited. Both relations are transitive. A distinguishing feature of PROSIT is that the language allows circularity [2]. The fact that PROSIT permits situations as arguments of infons makes it possible to write self referential statements. Consider a card game (sit1) between two players. John has the ace of spades and Mary has the queen of spades. When both players display their cards we have: sit1 (has John ....

..... The primary question to be answered in epistemic puzzles is generally about the facts that the agents are aware of. So a puzzle might ask if an agent, say x, is aware of the fact f i , i.e. whether f i 2 K x . However, this representation fails to handle two fundamental properties of knowledge [1, 2]: circularity (i.e. if a knows f 3 , then he knows that he knows f 3 , ad infinitum) and deductive omniscience (i.e. if a knows that p and p entails q, then a knows that q) For this representation to handle circularity of knowledge it should be extended such that each K i is an element of ....

[Article contains additional citation context not shown here]

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, 1987.


Situations and Computation: An Overview of Recent Research - Tin, Akman   (Correct)

....information, logic, philosophy, and the mind. The original theory was due to Jon Barwise and John Perry [6] The theory has matured over the last decade [12] and various versions of it have been applied to a number of linguistic issues, resulting in what is commonly known as situation semantics [2, 3, 5, 11, 15, 16, 18, 25]. Situation semantics aims at the construction of a mathematically rigorous theory of meaning, and the application of such a theory to natural language. The mathematical foundations of the theory are based on intuitions basically coming from set theory and logic [1, 3, 11, 12] One of the ....

....PROSIT s computational power is due to an ability to draw inferences via rules of inference. There is an inference engine similar to a Prolog interpreter. PROSIT offers a treatment of partial objects, such as situations and parameters. It can also deal with self referential expressions [5]. One can assert facts that a situation will support. For example, if s1 supports the fact that Bob is a young person, this can be defined in the current situation s as: s: s1 (young Bob) Note that the syntax is similar to that of Lisp and the fact is in the form of a predicate. The ....

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity, New York, N.Y.: Oxford University Press, 1987.


Situated Nonmonotonic Temporal Reasoning with BABY-SIT - Tin, Akman   (Correct)

....the system. Suppose bob is an individual and s1 is a situation. Then, these objects can be declared as: I bob: IND I s1: SIT In BABY SIT, situations are viewed, as usual, at an abstract level. This means that situations are sets of parametric infons, but they may be non well founded (circular) [2]. All situations are required to cohere. Situations (and hence the infons they support) may have spatio temporal dimensions. A situation can have information about another which is a part of the former. BABY SIT has a minimal situation w, called the background situation, which is a part of ....

....will define objects in the system, establish hierarchies between situations, or add infons to the existing situations. We start with the introduction of relations such as alive, loads, fires, etc. that will hold among objects. For example, fires is defined as follows: I fires j IND, IND [2] Its arguments must be filled by objects of type IND since the minimality conditions of the relation is given as 2. 5 Then, we define individuals such as fred, mary, etc. 3 Here and in Appendix A, stands for TRUE. 4 The reader may refer to [22] and [21] for a discussion on various ....

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, N.Y., 1987.


Situated Modeling of Epistemic Puzzles - Ersan, Akman (1995)   (1 citation)  Self-citation (Barwise)   (Correct)

No context found.

J. Barwise and J. Etchemendy, The Liar: An Essay on Truth and Circularity, Oxford University Press, New York, N.Y., 1987.


Information Retrieval and Situation Theory - Huibers, Lalmas, van Rijsbergen (1996)   (8 citations)  (Correct)

No context found.

Barwise, J., and Etchemendy, J. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, 1987.


Logical Theories for Agent Introspection - Bolander (2003)   (Correct)

No context found.

Jon Barwise and John Etchemendy. The Liar---An Essay on Truth and Circularity. Oxford University Press, 1987.


Contexts and Situations - Surav, Akman (1994)   (Correct)

No context found.

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, NY, 1987.


HYPERSOLVER: A Graph-Based Tool for Modeling with Sets - Akman, Pakkan (1993)   (Correct)

No context found.

J. Barwise and J. Etchemendy. The Liar: An Essay on Truth and Circularity. Oxford University Press, New York, 1987.


Anaphora and the Logic of Change - Muskens (1991)   (5 citations)  (Correct)

No context found.

Barwise, J and Etchemendy, 1987, The Liar: An Essay on Truth and Circularity, Oxford University Press.


Situated Consequence in Elementary Situation Theory - Seligman (1994)   (3 citations)  (Correct)

No context found.

J. Barwise and J. Etchemendy. The Liar: An Essay in Truth and Circularity. Basil Blackwell, Oxford, 1987.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC