Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/the-logic-of-events-TqiUXi0xf9
References (74)
-
The Resolution Axiom............................................................................................... Possibility and Impossibility -
G. Shafer (1998)
Mathematical Aspects of Artificial Intelligence -
J. McCarthy (1987)
SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCEMachine intelligence
-
R. Reiter (1991)
Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy -
F. Pirri, R. Reiter (1999)
Some contributions to the metatheory of the situation calculusJ. ACM, 46
-
L. Magnusson, Bengt Nordström (1994)
The ALF Proof Editor and Its Proof Engine -
N. Belnap (1992)
Branching space-timeSynthese, 92
-
(1997)
Laplace’s Essai was first published in 1814, and the fifth and definitive edition -
R. Constable, S. Allen, Mark Bromley, R. Cleaveland, J. Cremer, R. Harper, Douglas Howe, Todd Knoblock, N. Mendler, P. Panangaden, James Sasaki, Scott Smith (1986)
Implementing mathematics with the Nuprl proof development system -
Bengt Nordström, Kent Petersson, Jan Smith (1990)
Programming in Martin-Lo¨f's type theory: an introduction -
L. Vila (1994)
A survey on temporal reasoning in artificial intelligenceArtificial Intelligence Communications, 7
-
D. Dalen (1980)
Logic and structure -
Gilles Dowek, A. Felty, Hugo Herbelin, G. Huet, Benjamin Werner, Christine Paulin-Mohring (1990)
The Coq proof assistant user's guide : version 5.6 -
The ⊆ Ultrafilters in an Event Space Form an Event Tree -
B.A. Davey, H.A. Priestley (1990)
Introduction to Lattices and Order -
P. Martin-L¨of (1982)
Proceedings of the Sixth International Congress of Logic, Methodology, and Philosophy of Science -
L. Bolc, A. Szałas (1995)
Time and Logic: A Computational Approach -
M. Gelfond, V. Lifschitz (1993)
Representing Action and Change by Logic ProgramsJ. Log. Program., 17
-
E.A. Emerson, J.Y. Halpern (1986)
Sometimes" and "not never" revisited: On branching versus linear time temporal logicJournal of the Association for Computing Machinery, 33
-
Y. Shoham (1987)
Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence -
L. Stein, L. Morgenstern (1994)
Motivated Action Theory: a Formal Theory of Causal ReasoningArtif. Intell., 71
-
Fangzhen Lin, R. Reiter (1994)
State Constraints RevisitedJ. Log. Comput., 4
-
E. Emerson (1991)
Temporal and Modal Logic -
E. Emerson, Joseph Halpern (1986)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logicJ. ACM, 33
-
R. Reiter (1993)
Proving Properties of States in the Situation CalculusArtif. Intell., 64
-
T. Martin (1996)
Probabilités et critique philosophique selon Cournot -
R. Goldblatt (1987)
Logics of Time and Computation -
A. Andrew (2002)
Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical SystemsKybernetes, 31
-
P. Martin-Löf (1984)
Constructive mathematics and computer programmingStudies in logic and the foundations of mathematics, 104
-
(1986)
Postface. In Laplace -
Fangzhen Lin, R. Reiter (1997)
How to Progress a DatabaseArtif. Intell., 92
-
M. Shanahan (1997)
Solving the frame problem - a mathematical investigation of the common sense law of inertia -
Chitta Baral, M. Gelfond, A. Provetti (1997)
Representing Actions: Laws, Observations and HypothesesJ. Log. Program., 31
-
G. Shafer (1996)
The art of causal conjecture -
T. Coquand, G. Huet (1988)
The Calculus of ConstructionsInf. Comput., 76
-
Bengt Nordström, Kent Petersson, Jan Smith (1990)
Programming in Martin-Löf's Type Theory -
The Temporal Order: Happening First -
P. Martin-Löf (1984)
Intuitionistic type theory, 1
-
J. McCarthy, P. Hayes (1969)
Machine Intelligence -
Relative Complements in the Refinement Order -
(1986)
Intuitionistic logic. Pp. 225-339 of Handbook of Philosophical Logic -
E.A. Emerson (1990)
Handbook of Theoretical Computer Science -
Zhaohui Luo (1994)
Computation and reasoning - a type theory for computer science, 11
-
H. Levesque, R. Reiter, Y. Lespérance, Fangzhen Lin, R. Scherl (1997)
GOLOG: A Logic Programming Language for Dynamic DomainsJ. Log. Program., 31
-
E. Sandewall (1995)
Features and fluents (vol. 1): the representation of knowledge about dynamical systems -
J. Plato (1995)
The Axioms of Constructive GeometryAnn. Pure Appl. Log., 76
-
Diverging and Implying -
A. Troelstra, D. van Dalen (1988)
Constructivism in Mathematics -
G. Shafer (1998)
Proceedings of ECAI98 (13th European Conference on Artificial Intelligence) -
Aarne Ranta (1995)
Type-Theoretical Grammar -
G. Shafer (1998)
Mathematical foundations for probability and causality -
(1992)
Lego Proof Development System: User's Manual -
Happening Strictly After -
M. Golumbic (2002)
Annals of Mathematics and Artificial IntelligenceAnnals of Mathematics and Artificial Intelligence, 36
-
Llu Vila (1994)
A survey on temporal reasoning in artificial intelligenceAi Communications
-
Incomparable Events -
J. von Plato (1996)
Types for Proofs and Programs -
S. Brodetsky (1922)
Essai philosophique sur les probabilitésNature, 110
-
E. Sandewall (1994)
Features and fluents : representation of knowledge about dynamical systems -
The Refinement Order: Summary -
R. Reiter (1991)
The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression -
G. Shafer (1998)
Causal Logic -
R. Scherl, G. Shafer (1998)
A logic of action, causality, and the temporal relations of eventsProceedings. Fifth International Workshop on Temporal Representation and Reasoning (Cat. No.98EX157)
-
J. Robinson (1965)
A Machine-Oriented Logic Based on the Resolution PrincipleJ. ACM, 12
-
J. Plato (1995)
Organization and Development of a Constructive Axiomatization -
(1997)
Positive partial order, lattices, and Heyting algebras, unpublished -
Lawrence Paulson, T. Nipkow (1994)
Isabelle: A Generic Theorem Prover -
G. Szász, B. Balkay, G. Tóth (1965)
Introduction to lattice theoryAmerican Mathematical Monthly, 72
-
R. Scherl, G. Shafer (1998)
Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning (Time-98) -
M. Dummett (2000)
Elements of Intuitionism -
Javier Pinto (1998)
Occurrences and Narratives as Constraints in the Branching Structure of the Situation CalculusJ. Log. Comput., 8
-
R.A. Kowalski, M.J. Sergot (1986)
A logic-based calculus of eventsNew Generation Computing, 4
-
Javier Pinto (1994)
Temporal reasoning in the situation calculus -
Disjoint Merger
- Publisher
- Springer Journals
- Copyright
- Copyright © 2000 by Kluwer Academic Publishers
- Subject
- Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1023/A:1018964524717
- Publisher site
- See Article on Publisher Site
Abstract
An event space is a set of instantaneous events that vary both in time and specificity. The concept of an event space provides a foundation for a logical – i.e., modular and open – approach to causal reasoning. In this article, we propose intuitively transparent axioms for event spaces. These axioms are constructive in the intuitionistic sense, and hence they can be used directly for causal reasoning in any computational logical framework that accommodates type theory. We also put the axioms in classical form and show that in this form they are adequate for the representation in terms of event trees established by Shafer [40] using stronger axioms.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 8, 2004