Sciweavers

1523 search results - page 41 / 305
» Partially ordered secretaries
Sort
View
TPHOL
1997
IEEE
15 years 4 months ago
Higher Order Quotients and their Implementation in Isabelle HOL
This paper describes the concept of higher order quotients and an implementation in Isabelle. Higher order quotients are a generalization of quotients. They use partial equivalence...
Oscar Slotosch
128
Voted
TYPES
2000
Springer
15 years 4 months ago
Executing Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
Stefan Berghofer, Tobias Nipkow
CIE
2008
Springer
15 years 19 days ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
127
Voted
PVLDB
2010
122views more  PVLDB 2010»
14 years 7 months ago
ZINC: Efficient Indexing for Skyline Computation
We present a new indexing method named ZINC (for Z-order Indexing with Nested Code) that supports efficient skyline computation for data with both totally and partially ordered at...
Bin Liu, Chee-Yong Chan
98
Voted
APAL
2006
113views more  APAL 2006»
15 years 18 days ago
Coding by club-sequences
Given any subset A of 1 there is a proper partial order which forces that the predicate x A and the predicate x 1\A can be expressed by ZFC
David Asperó