186 search results - page 35 / 38 » Decidable Extensions of Church's Problem |
SODA
1992
ACM
13 years 11 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
LOGCOM
2008
13 years 9 months ago
2008
Question Answering (QA) is a task that deserves more collaboration between Natural Language Processing (NLP) and Knowledge Representation (KR) communities, not only to introduce r...
APAL
2002
13 years 9 months ago
2002
The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An ...
AI
1999
Springer
13 years 9 months ago
1999
Springer
A central problem in multistrategy learning systems is the selection and sequencing of machine learning algorithms for particular situations. This is typically done by the system ...
ICFEM
2009
Springer
13 years 7 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...