Action description languages, A and B(Gelfond and Lifschitz, Electronic Transactions on Artificial Intelligence, 1998, vol. 2, pp. 193210), are expressive instruments introduced for formalizing planning domains and planning problem instances. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of B, using Constraint Logic Programming over Finite Domains. The approach is then generalized to raise the use of constraints to the level of the action language itself. A prototype implementation has been developed, and the preliminary results are presented and discussed
Abstract. This paper describes a domain description language DDL.1 able to represent physical domain...
In this paper we describe a system that can be used to generate action effect specifications. Unlik...
textKnowledge about actions is an important part of commonsense knowledge studied in Artificial Inte...
We explore the use of Constraint Logic Programming (CLP) as a platform for experimenting with planni...
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting wi...
Action languages have gained popularity as a means for declaratively describing planning domains. Th...
Abstract. We present a CLP-based approach to reasoning about ac-tions in the presence of incomplete ...
Constraint Logic Programming languages on Finite Domains CLP(FD) provide a declarative framework for...
We live in a dynamic world, full of situations which can be manipulated by our actions. The ability ...
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
AbstractIncorporating new information into a knowledge base is an important problem which has been w...
Constraint Logic Programming solvers on finite domains use constraints to prune those combinations o...
Constraint Logic Programming languages on Finite Domains, CLP(FD), provide a declarative framework ...
This chapter introduces planning and knowledge representation in the declarative action language K. ...
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativi...
Abstract. This paper describes a domain description language DDL.1 able to represent physical domain...
In this paper we describe a system that can be used to generate action effect specifications. Unlik...
textKnowledge about actions is an important part of commonsense knowledge studied in Artificial Inte...
We explore the use of Constraint Logic Programming (CLP) as a platform for experimenting with planni...
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting wi...
Action languages have gained popularity as a means for declaratively describing planning domains. Th...
Abstract. We present a CLP-based approach to reasoning about ac-tions in the presence of incomplete ...
Constraint Logic Programming languages on Finite Domains CLP(FD) provide a declarative framework for...
We live in a dynamic world, full of situations which can be manipulated by our actions. The ability ...
International audienceWe describe the techniques used in finite domain contraint solvers in the Const...
AbstractIncorporating new information into a knowledge base is an important problem which has been w...
Constraint Logic Programming solvers on finite domains use constraints to prune those combinations o...
Constraint Logic Programming languages on Finite Domains, CLP(FD), provide a declarative framework ...
This chapter introduces planning and knowledge representation in the declarative action language K. ...
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativi...
Abstract. This paper describes a domain description language DDL.1 able to represent physical domain...
In this paper we describe a system that can be used to generate action effect specifications. Unlik...
textKnowledge about actions is an important part of commonsense knowledge studied in Artificial Inte...