121 search results - page 24 / 25 » Elimination of Negation in a Logical Framework |
PADL
2009
Springer
14 years 6 months ago
2009
Springer
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
AAAI
1998
13 years 7 months ago
1998
The utility problem occurs when the cost of the acquired knowledge outweighs its bene ts. When the learner acquires control knowledge for speeding up a problem solver, the bene t ...
WWW
2007
ACM
14 years 7 months ago
2007
ACM
Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently. Several normal forms, generalizing those for relational databa...
PLDI
2009
ACM
14 years 1 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
ALT
1995
Springer
13 years 9 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...