1 resultado para implementation issues
em Department of Computer Science E-Repository - King's College London, Strand, London
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- Applied Math and Science Education Repository - Washington - USA (1)
- Aquatic Commons (7)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (19)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (9)
- Boston University Digital Common (1)
- Brock University, Canada (2)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- Cambridge University Engineering Department Publications Database (6)
- CentAUR: Central Archive University of Reading - UK (11)
- Cochin University of Science & Technology (CUSAT), India (2)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (13)
- Dalarna University College Electronic Archive (3)
- Deakin Research Online - Australia (49)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Archives@Colby (1)
- Digital Commons - Michigan Tech (3)
- Digital Commons @ DU | University of Denver Research (2)
- Digital Commons at Florida International University (7)
- Digital Peer Publishing (3)
- DigitalCommons@The Texas Medical Center (4)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (2)
- Greenwich Academic Literature Archive - UK (2)
- Helda - Digital Repository of University of Helsinki (3)
- Indian Institute of Science - Bangalore - Índia (6)
- Instituto Politécnico do Porto, Portugal (3)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (4)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (1)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (12)
- Queensland University of Technology - ePrints Archive (699)
- Repositório Aberto da Universidade Aberta de Portugal (1)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (6)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (4)
- Universidad Politécnica de Madrid (16)
- Universidade Complutense de Madrid (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Montréal (1)
- Université de Montréal, Canada (4)
- University of Connecticut - USA (1)
- University of Michigan (5)
- University of Queensland eSpace - Australia (8)
- University of Washington (2)
Resumo:
First-order temporal logic is a coincise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics have identified important enumerable and even decidable fragments. In this paper we present the first resolution-based calculus for monodic first-order temporal logic. Although the main focus of the paper is on establishing completeness result, we also consider implementation issues and define a basic loop-search algorithm that may be used to guide the temporal resolution system.