Sciweavers

13603 search results - page 2347 / 2721
» On the Complexity of Computing Treelength
Sort
View
ECAI
1994
Springer
15 years 11 months ago
Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
Giuseppe De Giacomo, Maurizio Lenzerini
ECAI
1994
Springer
15 years 11 months ago
Combining the Lazy Label Evaluation with Focusing Techniques in an ATMS
For large problems the ATMS often becomes the main resource consumer in any reasoning system. We propose an architecture (the 2vATMS) that combines the advantages of two techniques...
Mugur M. Tatar
ICTL
1994
15 years 11 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
KGC
1993
Springer
15 years 11 months ago
Nonmonotonic Reasoning is Sometimes Simpler
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
Grigori Schwarz, Miroslaw Truszczynski
MAAMAW
1993
Springer
15 years 11 months ago
Coalition Formation Among Autonomous Agents
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...
Steven P. Ketchpel
« Prev « First page 2347 / 2721 Last » Next »