[UCI Department of Logic & Philosophy of Science| UCI Department of Philosophy|]
Compiled by
Eddie Yeghiayan
(with Cristina Bicchieri.) "Backwards Forward Induction." In Ronald Fagin ed., Theoretical Aspects of Reasoning about Knowledge, pp. 24-43. Proceedings of the Fifth Conference (TARK 94), March 13-16, 1994, Pacific Grove, Calif. San Francisco: Kauffman, 1994.
"The Complexity of Revision." Notre Dame Journal of Formal Logic (Winter 1994), 35(1):67-72.
"Conceptions and Paradoxes of Sets." Philosophia Mathematica (1999), 7(2):136-163.
"Defeasible Inheritance on Cyclic Networks." Artificial
Intelligence (May 1997), 92(1-2):1-24.
Abstract:"In this paper, we are
going to present a new notion of "extension" for defeasible inheritance
networks that allows us
to deal with cyclic nets. Horty has shown that cyclic nets need not have
extensions in the sense of Touretzky. This
paper presents a generalization of that notion of extension that can be
applied to cyclic nets. The present proposal is
inspired by a somewhat unexpected analogy between cyclic nets and
"semantically closed" languages, i.e., languages
containing their own truth predicate. Accordingly, this approach to
defeasible inheritance networks with cycles shows
similarities to the solution of semantic paradoxes put forth by Kripke."
"Defeasible Reasoning as a Cognitive Model." In Krister Segerberg, ed., The Parikh Project. Seven papers in honour of Rohit. Uppsala Prints and Preprints in Philosophy, 18. Uppsala: Department of Philosophy, Uppsala University, 1997.
"Definition." In Edward Craig, ed., Routledge Encyclopedia of Philosophy, Volume 2, pp. 845-848. London & New York: Routledge, 1998.
"A Directly Cautious Theory of Defeasible Consequence for Default Logic
via the Notion of General Extension." Artificial
Intellligence (April 1999), 109(1-2):71-109.
Abstract:"This paper introduces a
generalization of Reiter's notion of "extension" for default logic. The
main difference from the
original version mainly lies in the way conflicts among defaults are
handled: in particular, this notion of "general
extension" allows defaults not explicitly triggered to pre-empt other
defaults. A consequence of the adoption of such
a notion of extension is that the collection of all the general extensions
of a default theory turns out to have a nontrivial
algebraic structure. This fact has two major technical fall-outs: first,
it turns out that every default theory has a general
extension; second, general extensions allow one to define a well-behaved,
skeptical relation of defeasible
consequence for default theories, satisfying the principles of
Reflexivity, Cut, and Cautious Monotonicity formulated
by D. Gabbay.
Alternative developments are also considered, namely: (i) the important
case of semi-normal default theories (which
turn out to have a unique minimal extension); (ii) defeasible consequence
as based on extensions that are nonminimal
("optimal" in the sense of Manna and Shamir); and (iii) a variant of
general extensions that, at the cost of a slight
complication, avoids certain somewhat counterintuitive results.
This approach, inspired by Kripke's theory of truth, is parallel to, and
generalizes over, the treatment of defeasible
inheritance over cyclic networks obtained in the author's previous work;
vindicates the skeptical approach to
defeasible inheritance of Horty, Thomason, and Touretzky; and has
similarities to the results of Fitting and
Przymusiski in logic programming."
"Extensional Quotients for Type Theory." [Abstract] Bulletin of Symbolic Logic (1996), 2:451.
"Extensional Quotients for Type Theory and the Consistency Problem for NF." Journal of Symbolic Logic (March 1998), 63(1):247-261.
"Free Set Algebras Satisfying Systems of Equations." Journal of Symbolic Logic (December 1999), 64(4):1656-1674.
(with Cristina Bicchieri.) "Game-Theoretic Axioms for Local Rationality and Bounded Knowledge." Journal of Logic, Language and Information (1995), 4(2):145-167.
(with Cristina Bicchieri and Eithan Ephrati.) "Games Servers Play: A Procedural Approach." In M. Wooldridge, J.P. Müller, & M. Tambe, eds., Intelligent Agents II: Agents, Theories, Architectures, and Languages, pp. 127-142. IJCAI '95 Workshop (ATAL), Montreal, Canada, August 19-20, 1995: Proceedings. Lecture Notes in Artificial Intelligence, 1037. Berlin: Springer, 1995.
"Gödel, Penrose, e i fondamenti dell'intelligenza artificiale." Sistemi Intelligenti (1997), 9(3):353-376.
"Locke's Theory of Meaning and the Private Language Argument." Unpublished manuscript, 1993.
(with Cristina Bicchieri and others.) The Logic of the Game. To be published by MIT Press.
"Modal Logic on the Free Frame." In preparation.
"Non-Well-Founded Sets via Revision Rules". [Abstract] Journal of Symbolic Logic (1993), 58:371.
"Non-Well-Founded Sets via Revision Rules." Journal of Philosophical Logic (December 1994), 23(6):633-679.
"Proto-Semantics for Positive Free Logic." Journal of Philosophical Logic (2000), 29(3):277-294.
Review of Keith Simmons' Universality and the Liar: An Essay on Truth and the Diagonal Argument. Notre Dame Journal of Formal Logic (Winter 1996), 37(1):152-159.
Review of Robert C. Koons' Paradoxes of Belief and Strategic Rationality. Economics and Philosophy (October 1993), 9(2):305-313.
"Revision Rules: An Investigation into Non-Monotonic Inductive
Definitions (Circular Definitions, Truth Theory)." PhD Dissertation in
Philosophy, University of Pittsburgh,
1992.
Abstract in Dissertation
Abstracts International (February 1993), 53(8A):2845-A.
"A Revision-Theoretic Analysis of the Arithmetical Hierarchy." [Abstract] Journal of Symbolic Logic, (1994), 59:696-97.
"A Revision-Theoretic Analysis of the Arithmetical Hierarchy." Notre Dame Journal of Formal Logic (Spring 1994), 35(2):204-218.
"Term Models for Typed Comprehension." In preparation.
"Virtuous Circles: From Fixed Points to Revision Rules." In André Chapuis and Anil Gupta, eds., Circularity, Definition, and Truth, pp. 1-27. New Delhi & Atascadero, CA: Indian Council of Philosophical Research/Ridgeview, 2000.
"What's in a Function?" Synthese (May 1996), 107(2):167-204.
"Revision Rules: An Investigation into Non-Monotonic Inductive
Definitions (Circular Definitions, Truth Theory)." PhD Dissertation in
Philosophy, University of Pittsburgh,
1992.
Abstract in Dissertation
Abstracts International (February 1993), 53(8A):2845-A.
"Locke's Theory of Meaning and the Private Language Argument." Unpublished manuscript, 1993.
"Non-Well-Founded Sets via Revision Rules". [Abstract] Journal of Symbolic Logic (1993), 58:371.
Review of Robert C. Koons' Paradoxes of Belief and Strategic Rationality. Economics and Philosophy (October 1993), 9(2):305-313.
(with Cristina Bicchieri.) "Backwards Forward Induction." In Ronald Fagin ed., Theoretical Aspects of Reasoning about Knowledge, pp. 24-43. Proceedings of the Fifth Conference (TARK 94), March 13-16, 1994, Pacific Grove, Calif. San Francisco: Kauffman, 1994.
"The Complexity of Revision." Notre Dame Journal of Formal Logic (Winter 1994), 35(1):67-72.
"Non-Well-Founded Sets via Revision Rules." Journal of Philosophical Logic (December 1994), 23(6):633-679.
"A Revision-Theoretic Analysis of the Arithmetical Hierarchy." [Abstract] Journal of Symbolic Logic, (1994), 59:696-97.
"A Revision-Theoretic Analysis of the Arithmetical Hierarchy." Notre Dame Journal of Formal Logic (Spring 1994), 35(2):204-218.
(with Cristina Bicchieri.) "Game-Theoretic Axioms for Local Rationality and Bounded Knowledge." Journal of Logic, Language and Information (1995), 4(2):145-167.
(with Cristina Bicchieri and Eithan Ephrati.) "Games Servers Play: A Procedural Approach." In M. Wooldridge, J.P. Müller, & M. Tambe, eds., Intelligent Agents II: Agents, Theories, Architectures, and Languages, pp. 127-142. IJCAI '95 Workshop (ATAL), Montreal, Canada, August 19-20, 1995: Proceedings. Lecture Notes in Artificial Intelligence, 1037. Berlin: Springer, 1995.
"Extensional Quotients for Type Theory." [Abstract] Bulletin of Symbolic Logic (1996), 2:451.
Review of Keith Simmons' Universality and the Liar: An Essay on Truth and the Diagonal Argument. Notre Dame Journal of Formal Logic (Winter 1996), 37(1):152-159.
"What's in a Function?" Synthese (May 1996), 107(2):167-204.
"Defeasible Inheritance on Cyclic Networks." Artificial Intelligence (May 1997), 92(1-2):1-24.
"Defeasible Reasoning as a Cognitive Model." In Krister Segerberg, ed., The Parikh Project. Seven papers in honour of Rohit. Uppsala Prints and Preprints in Philosophy, 18. Uppsala: Department of Philosophy, Uppsala University, 1997.
"Gödel, Penrose, e i fondamenti dell'intelligenza artificiale." Sistemi Intelligenti (1997), 9(3):353-376.
"Definition." In Edward Craig, ed., Routledge Encyclopedia of Philosophy, Volume 2, pp. 845-848. London & New York: Routledge, 1998.
"Extensional Quotients for Type Theory and the Consistency Problem for NF." Journal of Symbolic Logic (March 1998), 63(1):247-261.
"Conceptions and Paradoxes of Sets." Philosophia Mathematica (1999), 7(2):136-163.
"A Directly Cautious Theory of Defeasible Consequence for Default Logic via the Notion of General Extension." Artificial Intellligence (April 1999), 109(1-2):71-109.
"Free Set Algebras Satisfying Systems of Equations." Journal of Symbolic Logic (December 1999), 64(4):1656-1674.
"Proto-Semantics for Positive Free Logic." Journal of Philosophical Logic (2000), 29(3):277-294.
"Virtuous Circles: From Fixed Points to Revision Rules." In André Chapuis and Anil Gupta, eds., Circularity, Definition, and Truth, pp. 1-27. New Delhi & Atascadero, CA: Indian Council of Philosophical Research/Ridgeview, 2000.
(with Cristina Bicchieri and others.) The Logic of the Game. To be published by MIT Press.
"Modal Logic on the Free Frame." In preparation.
"Term Models for Typed Comprehension." In preparation.
[UCI Department of Logic & Philosophy of Science| UCI Department of Philosophy|]