AMAI 2006 - PDF Preprint Papers

AMAI 2006 International Symposium on Artificial Intelligence and Mathematics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed AMAI-2006 Paper

click to vote

AMAI
2006
Springer

145views Artificial Intelligence» more AMAI 2006»

Possibilistic uncertainty handling for answer set programming

13 years 11 months ago

Download www.info.univ-angers.fr

In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...

Pascal Nicolas, Laurent Garcia, Igor Stépha...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	145	Possibilistic uncertainty handling for answer set programming	claim
2	136	An algebraic framework for temporal attribute characteristics	claim
3	135	Strong and uniform equivalence of nonmonotonic theories - an algebraic approach	claim
4	127	Functional and multivalued dependencies in nested databases generated by record and list constructor	claim
5	123	Symmetric approximate linear programming for factored MDPs with application to constrained problems	claim
6	122	Strong order equivalence	claim
7	122	Answer set based design of knowledge systems	claim
8	113	A generalization of the Lin-Zhao theorem	claim
9	112	Bargaining over multiple issues in finite horizon alternating-offers protocol	claim
10	108	Computational methods for database repair by signed formulae	claim
11	94	A split-combination approach to merging knowledge bases in possibilistic logic	claim
12	93	Mechanizing common knowledge logic using COQ	claim
13	90	Learning parallel portfolios of algorithms	claim
14	87	A clausal resolution method for branching-time logic ECTL+	claim
15	86	Stochastic process semantics for dynamical grammars	claim
16	85	Tableau-based automata construction for dynamic linear time temporal logic*	claim
17	83	Learning dynamic algorithm portfolios	claim
18	82	Message delay and DisCSP search algorithms	claim
19	75	Conceptual logic programs	claim
20	74	Multi-modal nonmonotonic logics of minimal knowledge	claim
21	70	A formal mathematical framework for modeling probabilistic hybrid systems	claim
22	63	Reasoning on temporal class diagrams: Undecidability results	claim
23	59	On a rule-based interpretation of default conditionals	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers