Results 1  10
of
14
ConGolog, a concurrent programming language based on the situation calculus: language and implementation
, 1998
"... As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. The language includes facilities for prioritizing the concurrent execution, interrupting the execution when certain conditions become true, and dealing with exogenous actions. ..."
Abstract

Cited by 206 (37 self)
 Add to MetaCart
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. The language includes facilities for prioritizing the concurrent execution, interrupting the execution when certain conditions become true, and dealing with exogenous actions. The language di ers from other procedural formalisms for concurrency in that the initial state can be incompletely speci ed and the primitive actions can be userde ned by axioms in the situation calculus. In a companion paper, a formal de nition in the situation calculus of such a programming language is presented and illustrated with detailed examples. In this paper, the mathematical properties of the programming language are explored. 1
Reasoning About Concurrent Execution, Prioritized Interrupts, and Exogenous Actions in the Situation Calculus
, 1997
"... As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a programming language is presented and illustrated with a detailed example. The language includes facilities for prioritiz ..."
Abstract

Cited by 64 (13 self)
 Add to MetaCart
As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a programming language is presented and illustrated with a detailed example. The language includes facilities for prioritizing the concurrent execution, interrupting the execution when certain conditions become true, and dealing with exogenous actions. The language differs from other procedural formalisms for concurrency in that the initial state can be incompletely specified and the primitive actions can be userdefined by axioms in the situation calculus.
RegionBased Qualitative Geometry
, 2000
"... We present a highly expressive logical language for describing qualitative configurations of spatial regions. We call the theory Region Based Geometry (RBG). Our axiomatisation is based on Tarski's Geometry of Solids, in which the parthood relation and the concept of sphere are taken as primitiv ..."
Abstract

Cited by 31 (14 self)
 Add to MetaCart
We present a highly expressive logical language for describing qualitative configurations of spatial regions. We call the theory Region Based Geometry (RBG). Our axiomatisation is based on Tarski's Geometry of Solids, in which the parthood relation and the concept of sphere are taken as primitive. We show that our theory is categorical: all models are isomorphic to a classical interpretation in terms of Cartesian spaces over R. We investigate
A situation calculus approach to modeling and programming agents
 Foundations of Rational Agency
, 1999
"... The notion of computational agents has become very fashionable lately [24, 32]. Building such agents seems to be a good way of congenially providing services to users in networked computer systems. Typical applications are information retrieval over the internet, automation of common user activities ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
The notion of computational agents has become very fashionable lately [24, 32]. Building such agents seems to be a good way of congenially providing services to users in networked computer systems. Typical applications are information retrieval over the internet, automation of common user activities, smart user interfaces,
A formal calculus for informal equality with binding
 In WoLLIC’07: 14th Workshop on Logic, Language, Information and Computation, volume 4576 of LNCS
, 2007
"... Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing captureavoidance constraints on where variables can and cannot occur free. We describe a logical derivation system which allows a direct formalisation of such assertions, along w ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing captureavoidance constraints on where variables can and cannot occur free. We describe a logical derivation system which allows a direct formalisation of such assertions, along with a direct formalisation of their constraints. We base our logic on equality, probably the simplest available judgement form. In spite of this, we can axiomatise systems of logic and computation such as firstorder logic or the lambdacalculus in a very direct and natural way. We investigate the theory of derivations, prove a suitable semantics sound and complete, and discuss existing and future research. 1
Inductive Definability and the Situation Calculus
 In Transaction and Change in Logic Databases
, 1998
"... . We explore the situation calculus within the framework of inductive definability. A consequence of this view of the situation calculus is to establish direct connections with different variants of the  calculus [Park, 1970; Hitchcock and Park, 1973; Pratt, 1981; Kozen, 1983; Emerson and Clark ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
. We explore the situation calculus within the framework of inductive definability. A consequence of this view of the situation calculus is to establish direct connections with different variants of the  calculus [Park, 1970; Hitchcock and Park, 1973; Pratt, 1981; Kozen, 1983; Emerson and Clarke, 1980], structural operational semantics of concurrent processes [Plotkin, 1981], and logic programming [Apt, 1990]. First we show that the induction principle on situations [Reiter, 1993] is implied by an inductive definition of the set of situations. Then we consider the frame problem from the point of view of inductive definability and by defining fluents inductively we obtain essentially the same form of successor state axioms as [Reiter, 1991]. Our approach allows extending this result to the case where ramification constraints are present. Finally we demonstrate a method of applying inductive definitions for computing fixed point properties of GOLOG programs. 1 Introduction...
A.: Nominal algebra
, 2006
"... Abstract. Nominal terms are a termlanguage used to accurately and expressively represent systems with binding. We present Nominal Algebra (NA), a theory of algebraic equality on nominal terms. Builtin support for binding in the presence of metavariables allows NA to closely mirror informal mathem ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. Nominal terms are a termlanguage used to accurately and expressively represent systems with binding. We present Nominal Algebra (NA), a theory of algebraic equality on nominal terms. Builtin support for binding in the presence of metavariables allows NA to closely mirror informal mathematical usage and notation, where expressions such as λa.t or ∀a.φ are common, in which metavariables t and φ explicitly occur in the scope of a variable a. We describe the syntax and semantics of NA, and provide a sound and complete proof system for it. We also give some examples of axioms; other work has considered sets of axioms of particular interest in some detail. 1.
Nonterminating processes in the situation calculus
 in: Proc. AAAI97 Workshop on Robots, Softbots, Immobots: Theories of Action, Planning and Control
, 1997
"... By their very design, many robot control programs are nonterminating. To give a simple example one we shall use in this paper an office coffeedelivery robot might be implemented as an infinite loop in which the robot responds to exogenous requests for coffee that are maintained on a queue. Since ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
By their very design, many robot control programs are nonterminating. To give a simple example one we shall use in this paper an office coffeedelivery robot might be implemented as an infinite loop in which the robot responds to exogenous requests for coffee that are maintained on a queue. Since a future coffee request is always possible, the program never terminates.
A Review of Three Techniques for Formally Representing Variable Binding
, 2006
"... This paper compares three models for formal reasoning about programming languages with binding. Higher order abstract syntax (hoas) uses metalevel binding to represent objectlevel binding [PE88]. Nominal Logic couples a concrete representation of bound variables with a formal apparatus for safel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper compares three models for formal reasoning about programming languages with binding. Higher order abstract syntax (hoas) uses metalevel binding to represent objectlevel binding [PE88]. Nominal Logic couples a concrete representation of bound variables with a formal apparatus for safely manipulating bound variables [Pit03]. The locally named binding representation places bound and free variables in different syntactic sorts [MP99]. This paper surveys each binding model, and compares it to the others and to Gordon and Melham’s axiomatization of the untyped lambda calculus [GM97]. Comparisons are made based on expressive power, transparency to human readers, and suitability for mechanized reasoning of each binding model. Each system excels in one area; hoas is most expressive, Nominal Logic most transparent, and locally named most mechanizable.
MIQIS: Modular Integration of Queryable Information Systems
, 2004
"... Information integration is not a new problem. ..."