
An Application of ProofTheory in Answer Set Programming
We apply prooftheoretic techniques in answer Set Programming. The main ...
read it

Affinely representable lattices, stable matchings, and choice functions
Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection b...
read it

Finding Proofs in Tarskian Geometry
We report on a project to use a theorem prover to find proofs of the the...
read it

On sets of indefinitely desubstitutable words
The stable set associated to a given set S of nonerasing endomorphisms o...
read it

Proofchecking Euclid
We used computer proofchecking methods to verify the correctness of our...
read it

Effective Kan fibrations in simplicial sets
We introduce the notion of an effective Kan fibration, a new mathematica...
read it
Representing All Stable Matchings by Walking a Maximal Chain
The seminal book of Gusfield and Irving [GI89] provides a compact and algorithmically useful way to represent the collection of stable matches corresponding to a given set of preferences. In this paper, we reinterpret the main results of [GI89], giving a new proof of the characterization which is able to bypass a lot of the "theory building" of the original works. We also provide a streamlined and efficient way to compute this representation. Our proofs and algorithms emphasize the connection to wellknown properties of the deferred acceptance algorithm.
READ FULL TEXT
Comments
There are no comments yet.