Sciweavers

1455 search results - page 57 / 291
» Programming in Logic with Constraints for Natural Language P...
Sort
View
POPL
2006
ACM
14 years 8 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
TBILLC
2007
Springer
14 years 1 months ago
Inquisitive Semantics: Two Possibilities for Disjunction
Abstract. We introduce an inquisitive semantics for a language of propositional logic, where the interpretation of disjunction is the source of inquisitiveness. Indicative conditio...
Jeroen Groenendijk
EACL
2003
ACL Anthology
13 years 9 months ago
Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
Stephan Kepser
ATAL
2011
Springer
12 years 7 months ago
Information-driven interaction-oriented programming: BSPL, the blindingly simple protocol language
We present a novel approach to interaction-oriented programming based on declaratively representing communication protocols. Our approach exhibits the following distinguishing fea...
Munindar P. Singh
FOAL
2009
ACM
14 years 2 months ago
A machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...
Benjamin Delaware, William R. Cook, Don S. Batory