Sciweavers

23 search results - page 1 / 5
» Negotiation by abduction and relaxation
Sort
View
ATAL
2007
Springer
13 years 9 months ago
Negotiation by abduction and relaxation
This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduc...
Chiaki Sakama, Katsumi Inoue
ICLP
2010
Springer
13 years 3 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
DLOG
2011
12 years 8 months ago
Relaxed Abduction: Robust Information Interpretation for Incomplete Models
This paper introduces relaxed abduction, a novel non-standard reasoning task for description logics. Although abductive reasoning over description logic knowledge bases has been ap...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
JELIA
2004
Springer
13 years 10 months ago
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
Ulrich Endriss, Paolo Mancarella, Fariba Sadri, Gi...
IAT
2003
IEEE
13 years 10 months ago
Designing Flexible Negotiation Agent with Relaxed Decision Rules
This article presents a model for designing negotiation agent with two distinguishing features: 1) a marketdriven strategy and 2) a set of relaxed decision rules. Market-driven ag...
Kwang Mong Sim, Shi Yu Wang