15033 search results - page 216 / 3007 » Complexity Theory and Algorithms |
108
click to vote
FOCM
2006
15 years 4 months ago
2006
We introduce some modifications and extensions of the concept od index pair in the Conley index theory. We then show how these concepts may be used to overcome some difficulties in...
139
click to vote
EPIA
2005
Springer
15 years 10 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
137
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
126
click to vote
ICALP
1997
Springer
15 years 8 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
175
click to vote
JELIA
1994
Springer
15 years 8 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...