In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages con...
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
The modularity of programming language descriptions allows the designer to describe each programming language feature in a separated module that can be studied independently of ot...