Sciweavers

315 search results - page 19 / 63
» Using Logic in the Generation of Referring Expressions
Sort
View
PLDI
2009
ACM
16 years 9 days ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...
BMCBI
2006
98views more  BMCBI 2006»
14 years 11 months ago
Quantitative comparison of EST libraries requires compensation for systematic biases in cDNA generation
Background: Publicly accessible EST libraries contain valuable information that can be utilized for studies of tissue-specific gene expression and processing of individual genes. ...
Donglin Liu, Joel H. Graber
94
Voted
ASE
2010
129views more  ASE 2010»
14 years 11 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
KBSE
1999
IEEE
15 years 4 months ago
Controlled Natural Language Can Replace First-Order Logic
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem we developed Attem...
Norbert E. Fuchs, Uta Schwertel, Sunna Torge
116
Voted
KI
2007
Springer
15 years 5 months ago
Extending Markov Logic to Model Probability Distributions in Relational Domains
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
Dominik Jain, Bernhard Kirchlechner, Michael Beetz