Verified Model Checking for Conjunctive Positive Logic. | 0 | 0.34 | 2021 |
Exact Learning: On the Boundary between Horn and CNF | 0 | 0.34 | 2020 |
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+. | 0 | 0.34 | 2020 |
One-Pass Context-Based Tableaux Systems for CTL and ECTL. | 0 | 0.34 | 2020 |
Towards Certified Model Checking for PLTL Using One-Pass Tableaux. | 0 | 0.34 | 2019 |
Exact learning of multivalued dependency formulas. | 0 | 0.34 | 2018 |
Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach. | 0 | 0.34 | 2018 |
Automatic White-Box Testing of First-Order Logic Ontologies. | 0 | 0.34 | 2017 |
New Steps on the Exact Learning of CNF. | 0 | 0.34 | 2016 |
Exact Learning of Multivalued Dependencies. | 0 | 0.34 | 2015 |
Invariant-Free Clausal Temporal Resolution | 1 | 0.34 | 2013 |
Negative results on learning multivalued dependencies with queries | 4 | 0.45 | 2011 |
Translating propositional extended conjunctions of Horn clauses into Boolean circuits | 0 | 0.34 | 2010 |
A Learning Algorithm for Deterministic Finite Automata using JFLAP | 0 | 0.34 | 2009 |
Dual Systems of Tableaux and Sequents for PLTL | 5 | 0.47 | 2009 |
A cut-free and invariant-free sequent calculus for PLTL | 9 | 0.77 | 2007 |
Negative Results on Learning Dependencies with Queries. | 2 | 0.39 | 2002 |
Learning Minimal Covers of Functional Dependencies with Queries | 6 | 0.54 | 1999 |
The structure of logarithmic advice complexity classes | 6 | 0.76 | 1998 |
Compressibility and uniform complexity | 1 | 0.37 | 1997 |
On the Sparse Set Conjecture for Sets with Low Denisty | 2 | 0.39 | 1995 |
Learnability of Kolmogorov-easy circuit expressions via queries | 0 | 0.34 | 1995 |
Degrees and Reducibilities of Easy Tally Sets | 2 | 0.40 | 1994 |
A note on polynomial-size circuits with low resource-bounded Kolmogorov complexity | 4 | 0.46 | 1994 |
Characterizations of Logarithmic Advice Complexity Classes | 13 | 1.02 | 1992 |