Sciweavers

403 search results - page 23 / 81
» Contracts for higher-order functions
Sort
View
88
Voted
AI
2008
Springer
14 years 12 months ago
The measurement of ranks and the laws of iterated contraction
: 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...
Matthias Hild, Wolfgang Spohn
JMLR
2012
13 years 2 months ago
Learning Low-order Models for Enforcing High-order Statistics
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...
Patrick Pletscher, Pushmeet Kohli
EDOC
2002
IEEE
15 years 4 months ago
On Expressing and Monitoring Behaviour in Contracts
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...
Zoran Milosevic, R. Geoff Dromey
JOLLI
1998
86views more  JOLLI 1998»
14 years 11 months ago
On the Logic of Theory Change: Contraction without Recovery
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...
Eduardo L. Fermé
SCP
1998
113views more  SCP 1998»
14 years 11 months ago
Linear-Time Hierarchies for a Functional Language Machine Model
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...
Eva Rose