Sciweavers

1963 search results - page 67 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
IJMSO
2008
135views more  IJMSO 2008»
15 years 2 months ago
An argumentation framework based on confidence degrees to combine ontology mapping approaches
: Ontology mapping has a key importance for applications such as information retrieval, database integration, and agent-communication. This paper presents an Argumentation Framewor...
Cássia Trojahn dos Santos, Paulo Quaresma, ...
ICSE
1997
IEEE-ACM
15 years 7 months ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson
CL
2000
Springer
15 years 7 months ago
A Logic Programming Application for the Analysis of Spanish Verse
Logic programming rules are provided to capture the rules governing formal poetry in Spanish. The resulting logic program scans verses in Spanish to provide their metric analysis. ...
Pablo Gervás
DATAMINE
2006
83views more  DATAMINE 2006»
15 years 2 months ago
Structural Hidden Markov Models Using a Relation of Equivalence: Application to Automotive Designs
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
Djamel Bouchaffra, Jun Tan
PLDI
2004
ACM
15 years 8 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken