2501 search results - page 293 / 501 » Logics with Rank Operators |
141
click to vote
ACL
1992
15 years 7 months ago
1992
Aspects of semantic interpretation, such as quantifier scoping and reference resolution, are often realised computationally by non-monotonic operations involving loss of informati...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
134
click to vote
ENTCS
2008
15 years 6 months ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
138
click to vote
AML
2006
15 years 6 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
155
click to vote
4OR
2004
15 years 6 months ago
2004
Abstract In this paper we address the problem of aggregating outranking statements from multiple preference criteria of ordinal significance. The concept of ordinal concordance of ...