Sciweavers

1650 search results - page 61 / 330
» The HOM problem is decidable
Sort
View
RTA
2000
Springer
14 years 1 months ago
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
Jordi Levy, Mateu Villaret
DLOG
2006
13 years 11 months ago
DL Actions with GCIs: a Pragmatic Approach
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...
Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wol...
ACTA
2002
84views more  ACTA 2002»
13 years 10 months ago
Formal properties of XML grammars and languages
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...
Jean Berstel, Luc Boasson
ENTCS
2002
108views more  ENTCS 2002»
13 years 9 months ago
Rewriting in the partial algebra of typed terms modulo AC
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...
Thomas Colcombet
CAD
1998
Springer
13 years 9 months ago
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
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...
Xiao-Shan Gao, Shang-Ching Chou