Sciweavers

2501 search results - page 49 / 501
» Logics with Rank Operators
Sort
View
JC
2002
50views more  JC 2002»
15 years 3 months ago
Verifying Topological Indices for Higher-Order Rank Deficiencies
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
R. Baker Kearfott, Jianwei Dian
WWW
2010
ACM
15 years 10 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
GG
2008
Springer
15 years 4 months ago
Open Petri Nets: Non-deterministic Processes and Compositionality
We introduce ranked open nets, a reactive extension of Petri nets which generalises a basic open net model introduced in a previous work by allowing for a refined notion of interf...
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Bar...
150
Voted
NAACL
2010
15 years 1 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
ECAI
2004
Springer
15 years 9 months ago
New Insights on the Intuitionistic Interpretation of Default Logic
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
Pedro Cabalar, David Lorenzo