Sciweavers

2766 search results - page 343 / 554
» Hybridizing a Logical Framework
Sort
View
IMCSIT
2010
15 years 3 months ago
Generation of First-Order Expressions from a Broad Coverage HPSG Grammar
This paper describes an application for computing first-order semantic representations of English texts. It is based on a combination of hybrid shallow-deep components arranged wit...
Ravi Coote, Andreas Wotzlaw
PROCEDIA
2011
14 years 9 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
ICLP
2009
Springer
16 years 7 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...
CADE
2004
Springer
16 years 7 months ago
Model Checking Using Tabled Rewriting
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
Zhiyao Liang
ICSE
2003
IEEE-ACM
16 years 6 months ago
The Deployer's Problem: Configuring Application Servers for Performance and Reliability
Frameworks such as J2EE are designed to simplify the process of developing enterprise applications by handling much of the complexity of concurrency, transaction, and persistence ...
Mukund Raghavachari, Darrell Reimer, Robert D. Joh...