Xishun Zhao

ACM Trans. Comput. Log., 2024

2023

Capturing the polynomial hierarchy by second-order revised Krom logic.

[BibT_eX]

[DOI]

Kexu Wang

Log. Methods Comput. Sci., 2023

2022

The Complexity and Expressive Power of Second-Order Extended Logic.

[BibT_eX]

[DOI]

CoRR, 2022

Capturing the polynomial hierarchy by second-order revised Krom logic.

[BibT_eX]

[DOI]

CoRR, 2022

2020

Multi-task learning using variational auto-encoder for sentiment classification.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2020

Multi-task learning using a hybrid representation for text classification.

[BibT_eX]

[DOI]

Neural Comput. Appl., 2020

2019

Logarithmic-Bounded Second-Order Quantifiers and Limited Nondeterminism.

[BibT_eX]

[DOI]

Kexu Wang

CoRR, 2019

2018

Stag hunt and trust emergence in social networks.

[BibT_eX]

[DOI]

Kim-Kwang Raymond Choo

Future Gener. Comput. Syst., 2018

Norm-based deontic logic for access control, some computational results.

[BibT_eX]

[DOI]

Xin Sun

Livio Robaldo

Future Gener. Comput. Syst., 2018

Quantum-enhanced Logic-based Blockchain I: Quantum Honest-success Byzantine Agreement and Qulogicoin.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Ali Baba and the Thief, Convention Emergence in Games.

[BibT_eX]

[DOI]

Xin Sun

Livio Robaldo

J. Artif. Soc. Soc. Simul., 2017

Realizing correlated equilibrium by secure computation.

[BibT_eX]

[DOI]

Lirong Qiu

Xin Sun

J. Inf. Secur. Appl., 2017

2016

Reasoning about actions with loops via Hoare logic.

[BibT_eX]

[DOI]

Jiankun He

Frontiers Comput. Sci., 2016

Unsatisfiable hitting clause-sets with three more clauses than variables.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Bounds for variables with few occurrences in conjunctive normal forms.

[BibT_eX]

[DOI]

CoRR, 2014

More on Descriptive Complexity of Second-Order HORN Logics.

[BibT_eX]

[DOI]

CoRR, 2014

Proof systems for planning under 0-approximation semantics.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2014

Reasoning about Actions with Loops.

[BibT_eX]

[DOI]

Jiankun He

Proceedings of the Artificial Intelligence: Methods and Applications, 2014

Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

2013

On Davis-Putnam reductions for minimally unsatisfiable clause-sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Complexity and expressive power of second-order extended Horn logic.

[BibT_eX]

[DOI]

Math. Log. Q., 2013

Proof Systems for Planning Under Cautious Semantics.

[BibT_eX]

[DOI]

Minds Mach., 2013

2011

Proof System for Plan Verification under 0-Approximation Semantics

[BibT_eX]

[DOI]

CoRR, 2011

On Variables with Few Occurrences in Conjunctive Normal Forms.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Transformations into Normal Forms for Quantified Circuits.

[BibT_eX]

[DOI]

Uwe Bubeck

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010

Resolution on Quantified Generalized Clause-sets..

[BibT_eX]

[DOI]

Jiwei Jin

J. Satisf. Boolean Model. Comput., 2010

NP-Logic Systems and Model-Equivalence Reductions

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009

Linear CNF formulas and satisfiability.

[BibT_eX]

[DOI]

Stefan Porschen

Ewald Speckenmeyer

Discret. Appl. Math., 2009

Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits.

[BibT_eX]

[DOI]

Uwe Bubeck

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

Computational complexity of quantified Boolean formulas with fixed maximal deficiency.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Jordan Areas and Grids.

[BibT_eX]

[DOI]

Norbert Th. Müller

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

An Extension of Deficiency and Minimal Unsatisfiability of Quantified Boolean Formulas.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2007

The Complexity of Some Subclasses of Minimal Unsatis able Formulas.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2007

Boolean Functions as Models for Quantified Boolean Formulas.

[BibT_eX]

[DOI]

K. Subramani

J. Autom. Reason., 2007

Complexity of Operators on Compact Sets.

[BibT_eX]

[DOI]

Norbert Th. Müller

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

2006

Minimal False Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005

Extension and equivalence problems for clause minimal formulae.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2005

Model-Equivalent Reductions.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.

[BibT_eX]

[DOI]

Uwe Bubeck

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004

Regular Disjunction-Free Default Theories.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2004

Equivalence Models for Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the SAT 2004, 2004

On Models for Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Logic versus Approximation, 2004

On Odd and Even Cycles in Normal Logic Programs.

[BibT_eX]

[DOI]

Fangzhen Lin

Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003

Fixed-Parameter Tractability of Disjunction-Free Default Reasoning.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2003

On the structure of some classes of minimal unsatisfiable formulas.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Complexity of argument-based default reasoning with specificity.

[BibT_eX]

[DOI]

AI Commun., 2003

Read-Once Unit Resolution.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

On Boolean Models for Quantified Boolean Horn Formulas.

[BibT_eX]

[DOI]

K. Subramani

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Complexity of the Unique Extension Problem in Default Logic.

[BibT_eX]

[DOI]

Paolo Liberatore

Fundam. Informaticae, 2002

The Complexity of Read-Once Resolution.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2002

2001

Complexity Results for 2CNF Default Theories.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

Some Algorithms for Extension Computation of Nonmonotonic Rule Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

Satisfiable Formulas Closed Under Replacement.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

2000

Complexity Results for Restricted Credulous Default Reasoning.

[BibT_eX]

[DOI]