Large-Scale Organizational Computing Requires Unstratified Reflection and Strong Paraconsistency
暂无分享,去创建一个
[1] Ole-Johan Dahl,et al. Class and Subclass Declarations (Reprint) , 2002, Software Pioneers.
[2] Munindar P. Singh,et al. Service-Oriented Computing: Semantics, Processes, Agents , 2010 .
[3] Carl Hewitt,et al. The Repeated Demise of Logic Programming and Why It Will Be Reincarnated , 2006, AAAI Spring Symposium: What Went Wrong and Why: Lessons from AI Research and Applications.
[4] Jeffrey Barlow. Dreaming in Code , 2007 .
[5] Wilfried Sieg,et al. Automated Search for Gödel’s Proofs , 2005 .
[6] Carl Hewitt,et al. A Universal Modular ACTOR Formalism for Artificial Intelligence , 1973, IJCAI.
[7] Richard W. Weyhrauch,et al. A Decidable Fragment of Predicate Calculus , 1984, Theor. Comput. Sci..
[8] J. Barkley Rosser,et al. Extensions of some theorems of Gödel and Church , 1936, Journal of Symbolic Logic.
[9] Carl Hewitt,et al. Common sense for concurrency and strong paraconsistency using unstratified inference and reflection , 2008, ArXiv.
[10] R. Carnap. Logische Syntax der Sprache , 1935 .
[11] Carolyn L. Talcott,et al. A foundation for actor computation , 1997, Journal of Functional Programming.
[12] M. H. Lob,et al. Solution of a Problem of Leon Henkin , 1955, J. Symb. Log..
[13] Imre Lakatos,et al. Mathematics, science and epistemology: A renaissance of empiricism in the recent philosophy of mathematics? , 1978 .
[14] Michael Wooldridge,et al. Reasoning about rational agents , 2000, Intelligent robots and autonomous agents.
[15] Carl Hewitt,et al. DAI betwixt and between: from 'intelligent agents' to open systems science , 1991, IEEE Trans. Syst. Man Cybern..
[16] Pablo Cayetano Noriega Blanco-Vigil. Agent mediated auctions: the fishmarket metaphor , 1998 .
[17] Hannes Leitgeb,et al. What Theories of Truth Should be Like (but Cannot be) , 2007 .
[18] C. I. Lewis,et al. The Semantic Conception of Truth and the Foundations of Semantics , 1944 .
[19] Carl Hewitt,et al. The Scientific Community Metaphor , 1988, IEEE Transactions on Systems, Man, and Cybernetics.
[20] Carlo Cellucci,et al. GÖDEL'S INCOMPLETENESS THEOREM AND THE PHILOSOPHY OF OPEN SYSTEMS , 1992 .
[21] Anthony Hunter,et al. Quasi-classical Logic: Non-trivializable classical reasoning from incosistent information , 1995, ECSQARU.
[22] Natarajan Shankar,et al. Metamathematics, machines, and Gödels's proof , 1994, Cambridge tracts in theoretical computer science.
[23] Neil Thomason,et al. 60% Proof Lakatos, Proof, and Paraconsistency , 2007 .
[24] Nicholas R. Jennings,et al. Commitments and conventions: The foundation of coordination in multi-agent systems , 1993, The Knowledge Engineering Review.
[25] A. Tarski,et al. Arithmetical extensions of relational systems , 1958 .
[26] Solomon Feferman,et al. Toward useful type-free theories. I , 1984, Journal of Symbolic Logic.
[27] Michael Clarke,et al. Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.
[28] Imre Lakatos,et al. A Renaissance of Empiricism in the Recent Philosophy of Mathematics* , 1976, The British Journal for the Philosophy of Science.
[29] Carl Hewitt,et al. What Is Commitment? Physical, Organizational, and Social (Revised) , 2006, COIN@AAMAS/ECAI.
[30] Solomon Feferman,et al. AXIOMS FOR DETERMINATENESS AND TRUTH , 2008, The Review of Symbolic Logic.
[31] R. Routley. Dialectical logic, semantics and metamathematics , 1979 .
[32] Anthony Hunter,et al. Paraconsistent logics , 1998 .