Sciweavers

28 search results - page 4 / 6
» A Preferential Constraint Satisfaction Technique for Natural...
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
APLAS
2000
ACM
13 years 11 months ago
Kima - An Automated Error Correction System for Concurrent Logic Programs
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
Yasuhiro Ajiro, Kazunori Ueda
RIAO
2000
13 years 8 months ago
Assisting requirements engineering with semantic document analysis
Requirements engineering is the first stage in the software life-cycle and is concerned with discovering and managing a software system's services, constraints and goals. Req...
Paul Rayson, Roger Garside, Peter Sawyer
WWW
2011
ACM
13 years 2 months ago
Analysis and tracking of emotions in english and bengali texts: a computational approach
The present discussion highlights the aspects of an ongoing doctoral thesis grounded on the analysis and tracking of emotions from English and Bengali texts. Development of lexica...
Dipankar Das
SIGSOFT
2005
ACM
14 years 8 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson