279 search results - page 4 / 56 » Computing Intersections of Horn Theories for Reasoning with ... |
AAAI
2000
13 years 8 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
TACAS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
FOSSACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
DIS
2003
Springer
14 years 5 days ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
AAMAS
2010
Springer
13 years 7 months ago
2010
Springer
Cognitive appraisal theories, which link human emotional experience to their interpretations of events happening in the environment, are leading approaches to model emotions. In th...