Add to ORKGAbstract. We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s preference and evaluate its performance.
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal subset of PD...
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativi...
AbstractIn this paper, we address the problem of specifying and computing preferred plans using rich...
Abstract. We present a declarative language, PP, for the specification of preferences between possib...
Preference logic programming (PLP) is an extension of constraint logic programming (CLP) for declara...
Preference handling is a problem of much theoretical and practical interest. In planning, preference...
Planning—in its classical sense—is the problem of finding a sequence of actions that achieves a pred...
„Were you to ask me which programming paradigm is likely to gain most in commercial significance ove...
In classical planning, the planner is given a concrete goal; it returns a plan for it or a failure m...
Modelling and reasoning with preferences in constraint-based systems has been considered for a long ...
Constraint programming, a methodology for solving diffi-cult combinatorial problems by representing ...
Preferences in constraint problems are common but signifi-cant in many real world applications. In t...
AbstractConstraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solv...
Recent advances in AI planning have centred upon the reduction of planning to a constraint satisfact...
AbstractPreference logic programming (PLP) is an extension of logic programming for declaratively sp...
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal subset of PD...
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativi...
AbstractIn this paper, we address the problem of specifying and computing preferred plans using rich...
Abstract. We present a declarative language, PP, for the specification of preferences between possib...
Preference logic programming (PLP) is an extension of constraint logic programming (CLP) for declara...
Preference handling is a problem of much theoretical and practical interest. In planning, preference...
Planning—in its classical sense—is the problem of finding a sequence of actions that achieves a pred...
„Were you to ask me which programming paradigm is likely to gain most in commercial significance ove...
In classical planning, the planner is given a concrete goal; it returns a plan for it or a failure m...
Modelling and reasoning with preferences in constraint-based systems has been considered for a long ...
Constraint programming, a methodology for solving diffi-cult combinatorial problems by representing ...
Preferences in constraint problems are common but signifi-cant in many real world applications. In t...
AbstractConstraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solv...
Recent advances in AI planning have centred upon the reduction of planning to a constraint satisfact...
AbstractPreference logic programming (PLP) is an extension of logic programming for declaratively sp...
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal subset of PD...
Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativi...
AbstractIn this paper, we address the problem of specifying and computing preferred plans using rich...