Sciweavers

1426 search results - page 64 / 286
» Specification of nonmonotonic reasoning
Sort
View
ECAI
2000
Springer
15 years 2 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
15 years 1 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...
AMAI
2000
Springer
15 years 1 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
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 Comp...
Vasco M. Manquinho, João P. Marques Silva
ICTAI
1997
IEEE
15 years 1 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
KR
1991
Springer
15 years 1 months ago
Rational Belief Revision
Theories of rational belief revision recently proposed by Alchourron, Gardenfors, Makinson, and Nebel illuminate many important issues but impose unnecessarily strong standards fo...
Jon Doyle