A theorem prover with dependent types for reasoning about actions

Frontiers in Artificial Intelligence and Applications

Volumn 179, Issue 1, 2008, Pages 12-23

  Barlatier, Patrick ^a   Dapoigny, Richard ^a  

^a UNIVERSITÉ DE SAVOIE   (France)

Author keywords

dependent types; ontology; Reasoning; Type theory

Indexed keywords

DEPENDENT TYPES; FIRST ORDER; FORMAL THEORY; ONTOLOGY'S; PARTIAL KNOWLEDGE; REASONING; REASONING ABOUT ACTIONS; THEOREM PROVERS; TRADITIONAL APPROACHES; TYPE THEORY;

FORMAL LANGUAGES;

EID: 70349848203     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-893-9-12     Document Type: Conference Paper

References (24)

1. F. Baader, C. Lutz, M. Milicic, U. Sattler and F. Wolter: Integrating Description Logics and action formalisms: First results. Procs. of AAAI'05, AAAI Press, (2005), 572-577.
2. H. Barendregt: Handbook of Logic in Computer Science, volume 2, chapter Lambda Calculi with Types, Oxford University Press, (1992), 117-309.
3. G. Betarte: Type checking dependent (record) types and subtyping. Journal of Functional and Logic Programming, 10(2), (2000), 137-166.
4. P. Boldini: Formalizing context in intuitionistic type theory. Fundamenta Informaticae, 42(2), (2000), 1-23.
5. P. Brézillon and S. Abu-Hakima: Using Knowledge in Its Context: Report on the IJCAI-93 Workshop. AI Magazine, 16(1), (1995), 87-91.
6. H. Chen, T. Finin, and Anupam Joshi: Using OWL in a Pervasive Computing Broker, In Workshop on Ontologies in Open Agent Systems (OAS), (2003) 9-16.
7. R. Cooper: Records and record types in semantic theory. J. Log. Comput., 15(2), (2005), 99-112.
8. T. Coquand, R. Pollack, and T. M. : A logical framework with dependently typed records. Fundamenta Informaticae, 20, (2005), 1-22.
9. T. Coquand, and G. Huet: The Calculus of Constructions, Information and Computation, 76(2/3), (1988), 95-120.
10. R. Dapoigny and P. Barlatier: Towards a context theory for context-aware systems. In Procs. of the 2nd IJCAI Workshop on Artificial Intelligence Techniques for Ambient Intelligence, (2007).
11. R. Dapoigny and P. Barlatier: Goal Reasoning with Context Record Types. In Procs. of CONTEXT'07, (2007) 164-177.
12. P. Dockhorn-Costa, J. Paulo A. Almeida, L. F. Pires, G. Guizzardi and M. van Sinderen: Towards Conceptual Foundations for Context-Aware Applications. Procs. of the AAAI'06 Workshop on Modeling and Retrieval of Context, AAAI Press, (2006), 54-58.
13. S. Hölldobler and D. Kuske: The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus, Logic for Programming and Automated Reasoning, LNCS 1955, Springer, (2000), 251-272.
14. W. A. Howard: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, chapter The formulae-as-types notion of construction, Academic Press, (1980), 479-490.
15. A. Kopylov: Dependent Intersection: A New Way of Defining Records in Type Theory, Procs. of the 18th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (2003), 86-95.
16. P. Martin-Löf: Constructive mathematics and computer programming. Logic, Methodology and Philosophy of Sciences, 6, (1982), 153-175.
17. Z. Luo: A Unifying Theory of Dependent Types : The Schematic Approach. LFCS, (1992) 293-304.
18. Z. Luo: Coercive subtyping Journal of Logic and Computation, (1999), 105-130.
19. J. Mc Carthy: Notes on Formalizing Context, Procs. of the 13th Int. Joint Conf. on Artificial Intelligence, (1993), 555-560.
20. J. McKinna: Why dependent types matter. SIGPLAN Not., 41(1), (2006).
21. A. Ranta: Type-Theoretical Grammar Oxford University Press, (1995).
22. M. Thielscher: Ramification and causality, Artificial Intelligence, (1997), 89(1-2), 317-364.
23. S. Valentini: Decidability in intuitionistic type theory is functionally decidable, Math. Logic, 42 (1996), 300-304.
24. S. Vassos and H. Levesque: Progression of Situation Calculus Action Theories with Incomplete Information, Procs. of the Int. Joint Conference on Artificial Intelligence (IJCAI'07, (2007), 2029-2034.