GOLOG

swMATH2159MaRDI QIDQ14703FDOQ14703

Author name not available (Why is that?)

Official website: http://cindy.informatik.uni-bremen.de/cosy/staff/dylla/publications/Diplomarbeit/node20.html

Described by source

• GOLOG: A logic programming language for dynamic domains

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic reasoning about epistemic action narratives
• Formalizing action and change in modal logic I: the frame problem
• Plan-based control of robotic agents. Improving the capabilities of autonomous robots
• Reasoning about nondeterministic and concurrent actions: A process algebra approach
• Innovations in robot mobility and control.
• Title not available (Why is that?)
• Declarative formalization of reasoning strategies: A case study on heuristic nonlinear planning
• John McCarthy's legacy
• Non-Markovian control in the Situation Calculus
• On knowledge-based programming with sensing in the situation calculus
• Temporal representation and reasoning in artificial intelligence: Issues and approaches
• Ability and knowing how in the situation calculus
• Theoretical Computer Science
• KI 2004: Advances in Artificial Intelligence
• Title not available (Why is that?)
• Title not available (Why is that?)
• An epistemic approach to nondeterminism: believing in the simplest course of events
• Formalizing narratives using nested circumscription
• A dynamic logic for acting, sensing, and planning
• Title not available (Why is that?)
• Reasoning about interaction protocols for customizing web service selection and composition
• What robots can do: robot programs and effective achievability
• Reactive policies with planning for action languages
• Programming rational agents in a modal action logic
• Reasoning about actions in dynamic linear time temporal logic
• Verification of agent navigation in partially-known environments
• Propositional dynamic logic for reasoning about first-class agent interaction protocols
• Agents, Multi-Agent Systems and Declarative Programming: What, When, Where, Why, Who, How?
• Web-based adaptive tutoring: An approach based on logic agents and reasoning about actions
• The situation calculus: a case for modal logic
• KI 2003: Advances in Artificial Intelligence
• Proof systems for planning under 0-approximation semantics
• Agent planning programs
• Automatic verification of Golog programs via predicate abstraction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Situation calculus for controller synthesis in manufacturing systems with first-order state representation
• Computing programs for generalized planning using a classical planner
• Astrahl
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reasoning about plan revision in BDI agent programs
• A model of three-way decisions for knowledge harnessing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-terminating processes in the situation calculus
• Where logic and agents meet
• DatalogMTL
• Scheduling in the situation calculus: A case study
• Heuristic planning: A declarative approach based on strategies for action selection
• Logic-based subsumption architecture
• Navigation and execution for mobile robots in dynamic environments: an integrated approach
• Computational Logic in Multi-Agent Systems
• Modeling biological networks by action languages via answer set programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reactive computing as model generation
• Partially observable game-theoretic agent programming in Golog
• JavaLog: a framework-based integration of Java and Prolog for agent-oriented programming
• A formalization of programs in first-order logic with a discrete linear order
• FLUX: A logic programming method for reasoning agents
• A formal characterisation of Hamblin's action-state semantics
• Title not available (Why is that?)
• Bounded situation calculus action theories
• Progression and verification of situation calculus agents with bounded beliefs
• Practical solution techniques for first-order MDPs
• Title not available (Why is that?)
• Logical omniscience and the cost of deliberation
• Knowledge, action, and the frame problem
• Title not available (Why is that?)
• Property persistence in the situation calculus
• A logical theory of localization
• A semantic characterization of a useful fragment of the situation calculus with knowledge
• On the semantics of deliberation in IndiGolog -- from theory to implementation
• Putting ABox updates into action
• Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes)
• A description logic based situation calculus
• How to progress a database
• From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem
• Agent deliberation in an executable temporal framework
• The independent choice logic for modelling multiple agents under uncertainty
• Robot location estimation in the situation calculus
• The cognitive agents specification language and verification environment
• Title not available (Why is that?)
• UEML
• i*
• DECAF
• CPlan
• AgentSpeak
• Jason
• Moise+
• 2APL
• METATEM
• simpleAPL
• SNet
• PDDL

This page was built for software: GOLOG