Sciweavers

937 search results - page 14 / 188
» On the Complexity of Partial Order Properties
Sort
View
JELIA
2010
Springer
14 years 8 months ago
Tabling with Answer Subsumption: Implementation, Applications and Performance
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
Terrance Swift, David Scott Warren
LMCS
2007
132views more  LMCS 2007»
14 years 9 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
RECOMB
2006
Springer
15 years 10 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
APAL
2006
70views more  APAL 2006»
14 years 10 months ago
On the Hamkins approximation property
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
William J. Mitchell
ICFEM
2009
Springer
14 years 7 months ago
A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
Jiri Barnat, Lubos Brim, Petr Rockai