Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming

DOI10.1007/978-3-642-30743-0_30zbMath1357.68256arXiv1108.5567OpenAlexW2197846518MaRDI QIDQ2900538

Peter Schüller, Yuliya Lierler

Publication date: 23 July 2012

Published in: Correct Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.5567

Mathematics Subject Classification ID

Logic programming (68N17) Natural language processing (68T50)

Related Items (4)

Performance Tuning in Answer Set Programming ⋮ Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming ⋮ Specifying and Verbalising Answer Set Programs in Controlled Natural Language ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates

Uses Software

• Paramils
• Gringo
• PDDL
• clasp
• CCGbank
• Penn Treebank
• Clingo
• iClingo
• IDPDraw

Cites Work

• Unnamed Item
• Unnamed Item
• Answer set programming and plan generation
• Logic programs with stable model semantics as a constraint programming paradigm
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• Modelling Grammar Constraints with Answer Set Programming.
• CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank
• Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models
• ParamILS: An Automatic Algorithm Configuration Framework
• Welfare Economics and Robinson Crusoe the Producer
• A logic programming approach to knowledge-state planning
• Conflict-Driven Answer Set Enumeration
• Engineering an Incremental ASP Solver

This page was built for publication: Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming