Sciweavers

308 search results - page 10 / 62
» Answer Set Programming Based on Propositional Satisfiability
Sort
View
177
Voted
ICLP
2010
Springer
15 years 10 months ago
Towards a General Argumentation System based on Answer-Set Programming
Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentatio...
Sarah Alice Gaggl
ICTAI
1997
IEEE
15 years 10 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...
204
Voted
ENC
2008
IEEE
16 years 24 days ago
Possibilistic-Based Argumentation: An Answer Set Programming Approach
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
Juan Carlos Nieves, Ulises Cortés, Mauricio...