1650 search results - page 61 / 330 » The HOM problem is decidable |
136
click to vote
RTA
2000
Springer
15 years 7 months ago
2000
Springer
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
122
click to vote
DLOG
2006
15 years 5 months ago
2006
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
124
click to vote
ACTA
2002
15 years 3 months ago
2002
We consider XML documents described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properties...
122
click to vote
ENTCS
2002
15 years 3 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
133
click to vote
CAD
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...