Result 1 to 14 of 14 total
On warranted inference in argument trees based framework. (English)
Benferhat, Salem (ed.) et al., Scalable uncertainty management. 5th international conference, SUM 2011, Dayton, OH, USA, October 10‒13, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23962-5/pbk). Lecture Notes in Computer Science 6929. Lecture Notes in Artificial Intelligence, 191-204 (2011).
1
On warranted inference in argument trees based framework (English)
SUM, 191-204 (2011).
2
Bridging possibilistic conditional knowledge bases and partially ordered bases. (English)
Janhunen, Tomi (ed.) et al., Logics in artificial intelligence. 12th European conference, JELIA 2010, Helsinki, Finland, September 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15674-8/pbk). Lecture Notes in Computer Science 6341. Lecture Notes in Artificial Intelligence, 38-50 (2010).
3
A new default theories compilation for MSP-entailment. (English)
J. Autom. Reasoning 45, No. 1, 39-59 (2010).
4
Bridging possibilistic conditional knowledge bases and partially ordered bases (English)
JELIA, 38-50 (2010).
5
Conflicts handling in cooperative intrusion detection: A description logic approach (English)
ICTAI (2), 360-362 (2010).
6
Complexity and cautiousness results for reasoning from partially preordered belief bases. (English)
Sossai, Claudio (ed.) et al., Symbolic and quantitative approaches to reasoning with uncertainty. 10th European conference, ECSQARU 2009, Verona, Italy, July 1‒3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02905-9/pbk). Lecture Notes in Computer Science 5590. Lecture Notes in Artificial Intelligence, 817-828 (2009).
7
Compiling the lexicographic inference using Boolean cardinality constraints. (English)
Gao, Yong (ed.) et al., Advances in artificial intelligence. 22nd Canadian conference on artificial intelligence, Canadian AI 2009, Kelowna, Canada, May 25‒27, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-01817-6/pbk). Lecture Notes in Computer Science 5549. Lecture Notes in Artificial Intelligence, 171-182 (2009).
8
Complexity and cautiousness results for reasoning from partially preordered belief bases (English)
ECSQARU, 817-828 (2009).
9
Compiling the lexicographic inference using Boolean cardinality constraints (English)
Canadian Conference on AI, 171-182 (2009).
10
A lexicographic inference for partially preordered belief bases (English)
KR, 507-517 (2008).
11
On the compilation of possibilistic default theories (English)
FLAIRS Conference, 613-618 (2008).
12
On the compilation of stratified belief bases under linear and possibilistic logic policies (English)
IJCAI, 2425-2430 (2007).
13
Cooperative bees swarm for solving the maximum weighted satisfiability problem (English)
IWANN, 318-325 (2005).
14
Result 1 to 14 of 14 total
Start
Contact
Print
General Help
