Sciweavers

7988 search results - page 66 / 1598
» A Useful Undecidable Theory
Sort
View
DEXA
2003
Springer
113views Database» more  DEXA 2003»
14 years 2 months ago
Termination Analysis of Active Rules with Priorities
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...
Alain Couchot
DLOG
2008
13 years 11 months ago
Rewriting Rules into SROIQ Axioms
Description Logics are a family of very expressive logics but some forms of knowledge are much more intuitive to formulate otherwise, say, as rules. Rules in DL can be dealt with t...
Francis Gasse, Ulrike Sattler, Volker Haarslev
EMNLP
2007
13 years 10 months ago
Treebank Annotation Schemes and Parser Evaluation for German
Recent studies focussed on the question whether less-configurational languages like German are harder to parse than English, or whether the lower parsing scores are an artefact o...
Ines Rehbein, Josef van Genabith
ACL
2006
13 years 10 months ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
IJCAI
2003
13 years 10 months ago
A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was suffici...
Yongmei Liu, Hector J. Levesque