Results 1 -
3 of
3
Augmenting Weight Constraints with Complex Preferences
"... Abstract. Preference-based reasoning is a form of commonsense reasoning that makes many problems easier to express and sometimes more likely to have a solution. In this paper, we present an approach to introducing preferences in the weight constraint construct, which is a very useful programming con ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
(Show Context)
Abstract. Preference-based reasoning is a form of commonsense reasoning that makes many problems easier to express and sometimes more likely to have a solution. In this paper, we present an approach to introducing preferences in the weight constraint construct, which is a very useful programming construct widely adopted in Answer Set Programming (ASP). We show, mainly by means of examples, the usefulness of the proposed extension, and we outline how to accordingly extend the ASP semantics. 1
Meta-axioms and Complex Preferences in Evolving Logical Agents
"... Abstract. In this paper, we introduce some improvements to a framework that we have previously proposed, based upon a multi-layered general agent model, where at each layer temporal-logic-like axioms and meta-axioms can be defined and dynamically checked. Their violation determines suitable repair a ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. In this paper, we introduce some improvements to a framework that we have previously proposed, based upon a multi-layered general agent model, where at each layer temporal-logic-like axioms and meta-axioms can be defined and dynamically checked. Their violation determines suitable repair actions to be undertaken by means of appropriate agent’s self-modifications. This in the perspective of a society of agents, where individuals should be able to learn and enlarge their patterns of behavior by observing and generalizing their observations, and also by “imitating ” other agents, or by “being told ” by them. Here, we extend the overall setting on the one hand by augmenting the temporal-logic-like rules with an ordered conjunction for checking/enforcing an order on events and actions, and on the other hand by introducing the possibility of defining and exploiting complex preferences based upon a (simplified) form of modal reasoning. 1
Preferences and Priorities in ASP
"... Abstract. In this paper we extend our previous work concerning preferences in Answer Set Programming (ASP), and integrate this work with PDL, a wellknown approach to answer set optimization. We thus obtain a powerful language for expressing preferences in ASP. ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. In this paper we extend our previous work concerning preferences in Answer Set Programming (ASP), and integrate this work with PDL, a wellknown approach to answer set optimization. We thus obtain a powerful language for expressing preferences in ASP.
