: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking f...
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
This paper addresses the problem of transforming natural language descriptions of contracts into a form that is suitable for automating various contract management functions. We i...
The postulate of Recovery, among the six postulates for theory contraction, formulated and studied by Alchourr´on, G¨ardenfors and Makinson is the one that has provoked most cont...
In STOC 93, Jones sketched the existence of a hierarchy within problems decidable in linear time by a first-order functional language based on tree-structured data (F), as well a...