725 search results - page 19 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
125
Voted
AAMAS
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
125
Voted
PRICAI
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we extend our earlier work on modelling the mental states of PRS-like agents by considering the dynamics of belief and modelling of action attempts. The major constr...
121
click to vote
IANDC
2006
15 years 2 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
124
click to vote
AI
2008
Springer
15 years 2 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
150
Voted
CORR
1998
Springer
15 years 2 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...