Sciweavers

258 search results - page 41 / 52
» Nonmonotonic Reasoning
Sort
View
IJCAI
1993
13 years 8 months ago
Notes on Formalizing Context
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
John McCarthy
LOPSTR
2009
Springer
14 years 1 months ago
Coinductive Logic Programming with Negation
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
Richard Min, Gopal Gupta
ATAL
2005
Springer
14 years 28 days ago
Towards a formal framework for the search of a consensus between autonomous agents
This paper aims at proposing a general formal framework for dialogue between autonomous agents which are looking for a common agreement about a collective choice. The proposed set...
Leila Amgoud, Sihem Belabbes, Henri Prade
ECAI
2000
Springer
13 years 11 months ago
Search Pruning Conditions for Boolean Optimization
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Vasco M. Manquinho, João P. Marques Silva
ATAL
2006
Springer
13 years 11 months ago
Belief revision for AgentSpeak agents
The AgentSpeak agent-oriented programming language has recently been extended with a number of new features, such as speech-act based communication, internal belief additions, and...
Natasha Alechina, Rafael H. Bordini, Jomi Fred H&u...