Sciweavers

1242 search results - page 114 / 249
» The Theory of Grammar Constraints
Sort
View
CADE
2006
Springer
16 years 6 months ago
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...
ACL
1998
15 years 7 months ago
A Descriptive Characterization of Tree-Adjoining Languages (Project Note)
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
James Rogers
APCHI
1998
IEEE
15 years 10 months ago
Eviss: A Visual System Having a Spatial Parser Generator
In this paper, a visual system Eviss is proposed. Visual systems proposed so far have been fixed on certain specifications. It is hard to make and modify such visual systems. Sinc...
Akihiro Baba, Jiro Tanaka
BMCBI
2005
162views more  BMCBI 2005»
15 years 6 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes
AIEDU
2006
77views more  AIEDU 2006»
15 years 6 months ago
Constraint-based Modeling and Ambiguity
Constraint-based modeling has been used in many application areas of Intelligent Tutoring Systems as a powerful means to analyse erroneous student solutions and generate helpful fe...
Wolfgang Menzel