scholarly journals Ordering constraints over feature trees

1997 ◽  
pp. 297-311 ◽  
Author(s):  
Martin Müller ◽  
Joachim Niehren ◽  
Andreas Podelski
Keyword(s):  
Ordering Constraints ◽  
Feature Trees

scholarly journals The First-Order Theory of Ordering Constraints over Feature Trees

2001 ◽  
Vol Vol. 4 no. 2 ◽  
Author(s):  
Martin Müller ◽  
Joachim Niehren ◽  
Ralf Treinen
Keyword(s):  
Finite Automata ◽  
Order Theory ◽  
Inclusion Problem ◽  
First Order ◽  
First Order Theory ◽  
Infinite Trees ◽  
Ordering Constraints ◽  
International Audience ◽  
Existential Quantification ◽  
Feature Trees

International audience The system FT< of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT< and its fragments in detail, both over finite trees and over possibly infinite trees. We prove that the first-order theory of FT< is undecidable, in contrast to the first-order theory of FT which is well-known to be decidable. We show that the entailment problem of FT< with existential quantification is PSPACE-complete. So far, this problem has been shown decidable, coNP-hard in case of finite trees, PSPACE-hard in case of arbitrary trees, and cubic time when restricted to quantifier-free entailment judgments. To show PSPACE-completeness, we show that the entailment problem of FT< with existential quantification is equivalent to the inclusion problem of non-deterministic finite automata. Available at http://www.ps.uni-saarland.de/Publications/documents/FTSubTheory_98.pdf

scholarly journals Weakly Supervised Action Labeling in Videos under Ordering Constraints

2014 ◽  
pp. 628-643 ◽  
Author(s):  
Piotr Bojanowski ◽  
Rémi Lajugie ◽  
Francis Bach ◽  
Ivan Laptev ◽  
Jean Ponce ◽  
...  
Keyword(s):  
Ordering Constraints ◽  
Weakly Supervised
Sign in / Sign up

Export Citation Format

Share Document