Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Automata presenting structures: A survey of the finite string case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
    A structure has a (finite-string) automatic presentation if the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Does the chimpanzee have a theory of mind?David Premack & G. Woodruff - 1978 - Behavioral and Brain Sciences 4 (4):515-629.
    An individual has a theory of mind if he imputes mental states to himself and others. A system of inferences of this kind is properly viewed as a theory because such states are not directly observable, and the system can be used to make predictions about the behavior of others. As to the mental states the chimpanzee may infer, consider those inferred by our own species, for example, purpose or intention, as well as knowledge, belief, thinking, doubt, guessing, pretending, liking, (...)
    Download  
     
    Export citation  
     
    Bookmark   1128 citations  
  • (1 other version)Does the chimpanzee have a theory of mind?David Premack & Guy Woodruff - 1978 - Behavioral and Brain Sciences 1 (4):515-526.
    Download  
     
    Export citation  
     
    Bookmark   824 citations  
  • (1 other version)Automata Presenting Structures: A Survey of the Finite String Case.Sasha Rubin, Werner DePauli-Schimanovich, T. U. Wien & Kurt Gödel-Ein Mathematischer Mythos - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
    A structure has a (finite-string)automatic presentationif the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Strips: A new approach to the application of theorem proving to problem solving.Richard E. Fikes & Nils J. Nilsson - 1971 - Artificial Intelligence 2 (3-4):189-208.
    Download  
     
    Export citation  
     
    Bookmark   217 citations  
  • Merging frameworks for interaction.Johan van Benthem, Jelle Gerbrandy, Tomohiro Hoshi & Eric Pacuit - 2009 - Journal of Philosophical Logic 38 (5):491-526.
    A variety of logical frameworks have been developed to study rational agents interacting over time. This paper takes a closer look at one particular interface, between two systems that both address the dynamics of knowledge and information flow. The first is Epistemic Temporal Logic (ETL) which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. The second framework is Dynamic Epistemic Logic (DEL) that describes interactive processes in terms of epistemic event (...)
    Download  
     
    Export citation  
     
    Bookmark   74 citations  
  • Epistemic planning for single- and multi-agent systems.Thomas Bolander & Mikkel Birkegaard Andersen - 2011 - Journal of Applied Non-Classical Logics 21 (1):9-34.
    In this paper, we investigate the use of event models for automated planning. Event models are the action defining structures used to define a semantics for dynamic epistemic logic. Using event models, two issues in planning can be addressed: Partial observability of the environment and knowledge. In planning, partial observability gives rise to an uncertainty about the world. For single-agent domains, this uncertainty can come from incomplete knowledge of the starting situation and from the nondeterminism of actions. In multi-agent domains, (...)
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Merging Frameworks for Interaction.Johan Benthem, Jelle Gerbrandy, Tomohiro Hoshi & Eric Pacuit - 2009 - Journal of Philosophical Logic 38 (5):491-526.
    A variety of logical frameworks have been developed to study rational agents interacting over time. This paper takes a closer look at one particular interface, between two systems that both address the dynamics of knowledge and information flow. The first is Epistemic Temporal Logic (ETL) which uses linear or branching time models with added epistemic structure induced by agents’ different capabilities for observing events. The second framework is Dynamic Epistemic Logic (DEL) that describes interactive processes in terms of epistemic event (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations