Sciweavers

3440 search results - page 379 / 688
» Logics For Context-Free Languages
Sort
View
EACL
2003
ACL Anthology
15 years 8 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
191
Voted
ANLP
2000
123views more  ANLP 2000»
15 years 8 months ago
Generating Text with a Theorem Prover
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
Ivan I. Garibay
SLP
1993
117views more  SLP 1993»
15 years 8 months ago
Boolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
Philippe Codognet, Daniel Diaz
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 7 months ago
Reasoning in Abella about Structural Operational Semantics Specifications
The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses -tree syntax to treat object ...
Andrew Gacek, Dale Miller, Gopalan Nadathur
DKE
2007
136views more  DKE 2007»
15 years 7 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda