Sciweavers

306 search results - page 33 / 62
» From Preference Logics to Preference Languages, and Back
Sort
View
TLCA
2009
Springer
14 years 2 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
CONCUR
1991
Springer
13 years 11 months ago
A Method for the Development of Totally Correct Shared-State Parallel Programs
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
Ketil Stølen
IJCNLP
2005
Springer
14 years 1 months ago
A Preliminary Work on Classifying Time Granularities of Temporal Questions
Abstract. Temporal question classification assigns time granularities to temporal questions ac-cording to their anticipated answers. It is very important for answer extraction and ...
Wei Li, Wenjie Li, Qin Lu, Kam-Fai Wong
ACL
2012
11 years 10 months ago
PORT: a Precision-Order-Recall MT Evaluation Metric for Tuning
Many machine translation (MT) evaluation metrics have been shown to correlate better with human judgment than BLEU. In principle, tuning on these metrics should yield better syste...
Boxing Chen, Roland Kuhn, Samuel Larkin
EATCS
2000
85views more  EATCS 2000»
13 years 7 months ago
A New Zero-One Law and Strong Extension Axioms
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
Andreas Blass, Yuri Gurevich