The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
cc-Golog: Towards More Realistic Logic-Based Robot Controllers
[article]
2000
arXiv
pre-print
Preserved Fulltext
In this paper, we show how these problems can be overcome by first extending the situation calculus to support continuous change and event-driven behavior and then presenting \ccgolog, a variant of \congolog ...
On the other hand, a logic-based control language like \congolog, based on the situation calculus, is well-suited for the latter. However, it has problems expressing event-driven behavior. ...
¬(s < S 0 ); 4. s < do(a, s ′ ) ≡ s ⊑ s ′ , where s ⊑ s ′ stands for (s < s ′ ) ∨ (s = s ′ ). 5. s ≺ s ′ ≡ s < s ′ ∧ ∀a, s * .s < do(a, s * ) ⊑ s ′ ⊃ P oss(a, s * ) The first is a second-order induction ...
arXiv:cs/0003032v1
fatcat:tlzykhygyrhufa34psroux77wi
ConGolog, a concurrent programming language based on the situation calculus
2000
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
A formal definition in the situation calculus of such a programming language is presented and illustrated with some examples. ...
The language differs from other procedural formalisms for concurrency in that the initial state can be incompletely specified and the primitive actions can be user-defined by axioms in the situation calculus ...
Acknowledgements This research has been funded by the National Science and Engineering Research Council of Canada. We thank Koen Hindriks for interesting discussions about this work ...
doi:10.1016/s0004-3702(00)00031-x
fatcat:bfwdgivvgjdoldwdngbbfgugty
A Situation Calculus Approach to Modeling and Programming Agents
[chapter]
1999
Applied Logic Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
THE SITUATION CALCULUS AND THE FRAME PROBLEM The situation calculus [17] is a first-order language (with some second-order features) for representing dynamically changing worlds. ...
Axioms specifying the agent of each primitive action. Some foundational, domain independent axioms. The latter foundational axioms include unique names axioms for situations, and an induction axiom. ...
doi:10.1007/978-94-015-9204-8_12
fatcat:3czszoh3mbd45hgzzoq33z2da4
Modeling Dynamic Domains with ConGolog
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we describe the process specification language ConGolog and show how it can be used to model business processes for requirements analysis. ...
The behavior of agents in the domain is specified in a concurrent process language, whose semantics is defined in the same logical framework. ...
Some foundational, domain independent axioms. The latter foundational axioms include unique names axioms for situations, and an induction axiom. ...
doi:10.1007/3-540-48738-7_27
fatcat:xrunj3i6cnba7e4pkwuppuen4i
Logic-Based Specification Languages for Intelligent Software Agents
[article]
2003
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
specifying and prototyping a MAS. ...
The six languages are ConGoLog, Agent-0, the IMPACT agent programming language, DyLog, Concurrent METATEM and Ehhf. ...
We also thank Matteo Baldoni (University of Torino, Italy), for his clarification on some aspects related with Dylog and Paolo Torroni (University of Bologna, Italy) for his support in the description ...
arXiv:cs/0311024v1
fatcat:2kaahbviqjfe5ea6noivhq4yly
Local Conditional High-Level Robot Programs
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a mechanism for performing local lookahead for the Golog family of high-level robot programs. ...
However, interleaving offline verification with execution in the world seems to be the most practical approach for large programs and complex scenarios involving information gathering and exogenous events ...
Acknowledgements I am grateful to Hector Levesque for many helpful discussions and comments. ...
doi:10.1007/3-540-45653-8_8
fatcat:q5igfbcf5vavdcdtu6ssaiiwta
Simulation of Advanced Transaction Models Using GOLOG
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We first formulate each ATM and its properties as a theory of a certain kind and formulas of the situation calculus, respectively. ...
Finally, we also indicate how to implement such a specification as a background theory for transaction programs written in the situation calculus based programming language GOLOG. ...
We are supported by NSERC, IRIS (Institute for Robotics and Intelligent Systems), and ITRC (Information Technology Research Centre of Ontario) and would like to gratefully mention them. ...
doi:10.1007/3-540-46093-4_19
fatcat:vnzrqfqwand6hdsr3ycv2unvve
GOLOG: A logic programming language for dynamic domains
1997
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
axioms about the preconditions and effects of actions and the initial state of the world. ...
It is based on a formal theory of action specified in an extended version of the situation calculus. A prototype implementation in Prolog has been developed. 0 Elsevier Science Inc., 1997 a ...
Intuitive Ontology for the Situation Calculus The situation calculus (McCarthy [201) is a first order language (with, as we shall see later, some second order features) specifically designed for representing ...
doi:10.1016/s0743-1066(96)00121-5
fatcat:4fn7qhkw7veuvlewbnexmutizq
The cognitive agents specification language and verification environment for multiagent systems
2002
Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 1 - AAMAS '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we describe CASL and a verification environment (CASLve) for it based on the PVS verification system. ...
The Cognitive Agents Specification Language (CASL) is a framework for specifying multiagent systems. ...
While versions of both Golog and ConGolog have been implemented, we are mainly interested here in the potential for using ConGolog as a specification language. ...
doi:10.1145/544741.544746
dblp:conf/atal/ShapiroLL02
fatcat:cyqqxa4lljgotkzaldtpzbxwme
The cognitive agents specification language and verification environment for multiagent systems
2002
Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 1 - AAMAS '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we describe CASL and a verification environment (CASLve) for it based on the PVS verification system. ...
The Cognitive Agents Specification Language (CASL) is a framework for specifying multiagent systems. ...
While versions of both Golog and ConGolog have been implemented, we are mainly interested here in the potential for using ConGolog as a specification language. ...
doi:10.1145/544743.544746
fatcat:xykyw7xng5hedo7q6pxlk3hzvy
ElGolog: A High-Level Programming Language with Memory of the Execution History
2020
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
in a first-order variant of two-way linear dynamic logic that uses ElGolog programs with converse. ...
We show that in spite of rich tests, ElGolog shares key features with Golog, including a sematics based on macroexpansion into situation calculus formulas, upon which regression can still be applied. ...
Acknowledgments This work is supported in part by the European Research Council under the European Union's Horizon 2020 programme through the ERC Advanced Grant WhiteMec (No. 834228), and the National ...
doi:10.1609/aaai.v34i03.5669
fatcat:hxje6o4dvbhqtg7cleiwwpxcfi
Verifying ConGolog Programs on Bounded Situation Calculus Theories
2016
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This can also be done for arbitrary programs, but only to check certain properties, such as if a situation is the result of a program execution, not for mu-calculus verification. ...
To do this, we reformulate the transition semantics of ConGolog to keep the bindings of "pick variables" into a separate variable environment whose size is naturally bounded by the number of variables. ...
A basic action theory D is a collection of first-order axioms (plus a domain independent second-order characterization of situation terms) conveniently specifying (in terms of size and computational properties ...
doi:10.1609/aaai.v30i1.10117
fatcat:ynow2wwmb5fr3lx34rmqg2vwbe
Specifying active databases as non-Markovian theories of actions
2008
Journal of Intelligent Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
More precisely: we represent the rule set as a program written in a suitable version of the situation calculus based language ConGolog; then we extend an existing situation calculus based framework for ...
Transaction processing and rule execution is modelled as a theorem proving task using active relational theories as background axioms. ...
Theories The situation calculus [35, 47] is a many-sorted second order language for axiomatizing dynamic worlds. ...
doi:10.1007/s10844-007-0050-3
fatcat:jqhe4vynofbkzolftpucljwzae
Planning under uncertainty as GOLOGprograms
2003
Journal of experimental and theoretical artificial intelligence (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The GOLOG programming language (Levesque et al. 1997 , Giacomo et al. 2000 has been proposed as a highlevel agent programming language whose semantics is based on the Situation Calculus. ...
In this article we present algorithms that generate conditional GOLOG programs in a Situation Calculus extended with uncertainty of the effects of actions and complete observability of the world. ...
Acknowledgements Jorge Baier dedicates this paper to the memory of his friend and advisor, Javier A. Pinto who unexpectedly left us before this paper was concluded. ...
doi:10.1080/0952813031000064567
fatcat:riapqsegjfcfbablqgguxivl6q
Golog Speaks the BDI Language
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Second, it provides BDI languages a clear classical-logic-based semantics and a powerful logical foundation for incorporating new reasoning capabilities not present in typical BDI systems. ...
First, it demonstrates how practical agent systems can be developed using high-level languages like Golog or IndiGolog. ...
Acknowledgments We thank the reviewers for their interesting comments. ...
doi:10.1007/978-3-642-14843-9_6
fatcat:jwiadqsqgzhzxfixgwadhzkhrm
« Previous
Showing results 1 — 15 out of 42 results