Sciweavers

1455 search results - page 49 / 291
» Programming in Logic with Constraints for Natural Language P...
Sort
View
FM
2009
Springer
124views Formal Methods» more  FM 2009»
14 years 2 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
COGSCI
2010
87views more  COGSCI 2010»
13 years 6 months ago
The Logical Problem of Language Acquisition: A Probabilistic Perspective
Natural language is full of patterns that appear to fit with general linguistic rules but are ungrammatical. There has been much debate over how children acquire these ‘‘ling...
Anne S. Hsu, Nick Chater
CLIMA
2007
13 years 9 months ago
Language Constructs for Multi-agent Programming
Abstract. In this paper we are concerned with proposing, analyzing and implementing simple, yet flexible, constructs for multi-agent programming. In particular, we wish to extend ...
Louise A. Dennis, Michael Fisher, Anthony Hepple
ICLP
2009
Springer
14 years 8 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...