Sciweavers

26 search results - page 3 / 6
» CLG(n): Constraint Logic Grammars
Sort
View
81
Voted
ICLP
2005
Springer
15 years 3 months ago
HYPROLOG: A New Logic Programming Language with Assumptions and Abduction
We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integri...
Henning Christiansen, Verónica Dahl
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 2 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
EACL
2003
ACL Anthology
14 years 11 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ä
ACL
2008
14 years 11 months ago
A Logical Basis for the D Combinator and Normal Form in CCG
The standard set of rules defined in Combinatory Categorial Grammar (CCG) fails to provide satisfactory analyses for a number of syntactic structures found in natural languages. T...
Frederick Hoyt, Jason Baldridge
74
Voted
CORR
2004
Springer
151views Education» more  CORR 2004»
14 years 9 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...