150 search results - page 29 / 30 » Complexity of the Unique Extension Problem in Default Logic |
TABLEAUX
2005
Springer
15 years 2 months ago
2005
Springer
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
175
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
JCSS
2000
14 years 9 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
DCOSS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
LPNMR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...