default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHantao Zhang 0001
Person information
- affiliation: University of Iowa, Department of Computer Science, Iowa City, IA, USA
- affiliation (PhD 1988): Rensselaer Polytechnic Institute, Department of Computer Science, Troy, NY, USA
Other persons with the same name
- Hantao Zhang — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j42]Dianhua Wu, Hantao Zhang
:
Holey Schröder designs of type 3nu1. Discret. Math. 346(9): 113449 (2023)- [c44]Minghao Liu, Rui Han, Fuqi Jia, Pei Huang, Feifei Ma, Hantao Zhang, Jian Zhang:
Investigating the Existence of Holey Latin Squares via Satisfiability Testing. PRICAI (2) 2023: 410-422 - 2022
- [j41]Hantao Zhang, Baoluo Meng, Yiwen Liang:
Sort race. Softw. Pract. Exp. 52(8): 1867-1878 (2022)
2010 – 2019
- 2018
- [c43]Pei Huang, Feifei Ma, Cunjing Ge, Jian Zhang, Hantao Zhang:
Investigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability Testing. IJCAR 2018: 354-369 - 2016
- [j40]Hantao Zhang, Stanley Ziewacz:
On Holey Schroder Designs of Type 2nu1. Ars Comb. 128: 373-401 (2016) - [j39]H. Yu, D. Wu, Hantao Zhang:
The Existence of Irrational Diagonally Ordered Magic Squares. Graphs Comb. 32(5): 2159-2170 (2016) - [j38]Hantao Zhang:
An Experiment with Satisfiability Modulo SAT. J. Autom. Reason. 56(2): 143-154 (2016) - [i1]Hantao Zhang, Baoluo Meng, Yiwen Liang:
Sort Race. CoRR abs/1609.04471 (2016) - 2014
- [j37]Yong Zhang, Kejun Chen, Nanyuan Cao, Hantao Zhang:
Strongly symmetric self-orthogonal diagonal Latin squares and Yang Hui type magic squares. Discret. Math. 328: 79-87 (2014) - 2013
- [j36]Hantao Zhang:
25 new rr-self-orthogonal Latin squares. Discret. Math. 313(17): 1746-1753 (2013) - [c42]Hantao Zhang, Jian Zhang:
MACE4 and SEM: A Comparison of Finite Model Generators. Automated Reasoning and Mathematics 2013: 101-130 - 2012
- [j35]Frank E. Bennett, Hantao Zhang:
Holey Schröder designs of type 4n u1. Australas. J Comb. 54: 231-260 (2012) - [j34]Frank E. Bennett, Hantao Zhang:
Schröder quasigroups with a specified number of idempotents. Discret. Math. 312(5): 868-882 (2012) - [j33]Frank E. Bennett, Hantao Zhang:
Quasigroups satisfying Stein's third law with a specified number of idempotents. Discret. Math. 312(24): 3585-3605 (2012) - 2010
- [c41]James J. Lu, Sebastien Siva, Ojas Parekh, George H. L. Fletcher, Hantao Zhang:
Constraint processing in relational database systems: from theory to implementation. SAC 2010: 2066-2070
2000 – 2009
- 2008
- [j32]Yunqing Xu, Yanxun Chang, Gennian Ge, Hantao Zhang:
Frame self-orthogonal Mendelsohn triple systems of type hn. Discret. Math. 308(22): 5049-5063 (2008) - [j31]R. Julian R. Abel, Frank E. Bennett, Hantao Zhang:
Existence of HSOLSSOMs of type 2nu1. Discret. Math. 308(22): 5149-5173 (2008) - [c40]Sebastien Siva, James J. Lu, Hantao Zhang:
A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract). ICLP 2008: 774-778 - 2006
- [c39]Hantao Zhang:
A Complete Random Jump Strategy with Guiding Paths. SAT 2006: 96-101 - 2005
- [j30]Haiou Shen, Hantao Zhang:
Improving exact algorithms for MAX-2-SAT. Ann. Math. Artif. Intell. 44(4): 419-436 (2005) - [c38]Haiou Shen, Hantao Zhang:
Another Complete Local Search Method for SAT. LPAR 2005: 595-605 - 2004
- [j29]Frank E. Bennett, Hantao Zhang:
Latin Squares with Self-Orthogonal Conjugates. Discret. Math. 284(1-3): 45-55 (2004) - [c37]Haiou Shen, Hantao Zhang:
Study of Lower Bound Functions for MAX-2-SAT. AAAI 2004: 185-190 - [c36]Jian Zhang, Hantao Zhang:
Extending Finite Model Searching with Congruence Closure Computation. AISC 2004: 94-102 - [c35]Haiou Shen, Hantao Zhang:
Improving Exact Algorithms for MAX-2-SAT. AI&M 2004 - [c34]Zhuo Huang, Hantao Zhang, Jian Zhang:
Improving First-order Model Searching by Propositional Reasoning and Lemma Learning. SAT 2004 - [c33]Hantao Zhang, Dapeng Li, Haiou Shen:
A SAT Based Scheduler for Tournament Schedules. SAT 2004 - 2003
- [j28]Frank E. Bennett, Beiliang Du, Hantao Zhang:
Existence of self-orthogonal diagonal Latin squares with a missing subsquare. Discret. Math. 261(1-3): 69-86 (2003) - [j27]Lie Zhu, Hantao Zhang:
Completing the spectrum of r-orthogonal Latin squares. Discret. Math. 268(1-3): 343-349 (2003) - [j26]Haiou Shen, Hantao Zhang:
An Empirical Study of MAX-2-SAT Phase Transitions. Electron. Notes Discret. Math. 16: 80-92 (2003) - [j25]Peter Baumgartner, Hantao Zhang:
Preface to First order theorem proving. J. Symb. Comput. 36(1-2): 1-3 (2003) - [c32]Hantao Zhang, Haiou Shen, Felip Manyà:
Exact Algorithms for MAX-SAT. FTP 2003: 190-203 - 2002
- [j24]Yungqing Xu, Hantao Zhang, Lie Zhu:
Existence of frame SOLS of type anb1. Discret. Math. 250(1-3): 211-230 (2002) - [j23]Qiaoming Han, Yinyu Ye, Hantao Zhang, Jiawei Zhang:
On approximation of max-vertex-cover. Eur. J. Oper. Res. 143(2): 342-355 (2002) - 2001
- [j22]R. Julian R. Abel, Frank E. Bennett, Hantao Zhang, Lie Zhu:
Steiner pentagon covering designs. Discret. Math. 231(1-3): 11-26 (2001) - [j21]Lie Zhu, Hantao Zhang:
A few more r-orthogonal latin squares. Discret. Math. 238(1-3): 183-191 (2001) - 2000
- [j20]R. Julian R. Abel, Frank E. Bennett, Hantao Zhang, Lie Zhu:
A few more incomplete self-orthogonal Latin squares and related designs. Australas. J Comb. 21: 85-94 (2000) - [j19]R. Julian R. Abel, Frank E. Bennett, Hantao Zhang, Lie Zhu:
Existence of HSOLSSOMs with type hn and 1nu1. Ars Comb. 55 (2000) - [j18]Hantao Zhang, Mark E. Stickel:
Implementing the Davis-Putnam Method. J. Autom. Reason. 24(1/2): 277-296 (2000) - [c31]Peter Baumgartner, Christian G. Fermüller, Nicolas Peltier, Hantao Zhang:
Workshop: Model Computation - Principles, Algorithms, Applications. CADE 2000: 513
1990 – 1999
- 1998
- [j17]Frank E. Bennett, Jianxing Yin, Hantao Zhang, R. Julian R. Abel:
Perfect Mendelsohn Packing Designs with Block Size Five. Des. Codes Cryptogr. 14(1): 5-22 (1998) - [j16]R. Julian R. Abel, Hantao Zhang:
Direct constructions for certain types of HMOLS. Discret. Math. 181(1-3): 1-17 (1998) - 1997
- [j15]R. Julian R. Abel, Charles J. Colbourn, Jianxing Yin, Hantao Zhang:
Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda. Des. Codes Cryptogr. 10(3): 275-307 (1997) - [c30]Hantao Zhang:
SATO: An Efficient Propositional Prover. CADE 1997: 272-275 - 1996
- [j14]Frank E. Bennett, Hantao Zhang, Lie Zhu:
Self-Orthogonal Mendelsohn Triple Systems. J. Comb. Theory A 73(2): 207-218 (1996) - [j13]Hantao Zhang, Maria Paola Bonacina, Jieh Hsiang:
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems. J. Symb. Comput. 21(4): 543-560 (1996) - [c29]Jian Zhang, Hantao Zhang:
Combining Local Search and Backtracking Techniques for Constraint Satisfaction. AAAI/IAAI, Vol. 1 1996: 369-374 - [c28]Jian Zhang, Hantao Zhang:
System Description: Generating Models by SEM. CADE 1996: 308-312 - 1995
- [j12]Hantao Zhang:
Contextual Rewriting in Automated Reasoning. Fundam. Informaticae 24(1/2): 107-123 (1995) - [j11]Deepak Kapur, G. Sivakumar, Hantao Zhang:
A Path Ordering for Proving Termination of AC Rewrite Systems. J. Autom. Reason. 14(2): 293-316 (1995) - [c27]Jian Zhang, Hantao Zhang:
Constraint Propagation in Model Generation. CP 1995: 398-414 - [c26]Jian Zhang, Hantao Zhang:
SEM: a System for Enumerating Models. IJCAI 1995: 298-303 - [c25]Mark E. Stickel, Hantao Zhang:
Studying Quasigroup Identities by Rewriting Techniques: Problems and First Results. RTA 1995: 450-456 - 1994
- [j10]Hantao Zhang:
A New Method for the Boolean Ring Based Theorem Proving. J. Symb. Comput. 17(2): 189-211 (1994) - [c24]Sun Kim, Hantao Zhang:
ModGen: Theorem Proving by Model Generation. AAAI 1994: 162-167 - [c23]Hantao Zhang, Maria Paola Bonacina:
Cumulating Search in a Distributed Computing Environment: A Case Study in Parallel Satisfiability. PASCO 1994: 422-431 - 1993
- [j9]Hantao Zhang, Gary Xin Hua:
Proving Ramsey's Theorem by the Cover Set Induction: A Case and Comparison Study. Ann. Math. Artif. Intell. 8(3-4): 383-405 (1993) - [j8]Hantao Zhang:
Automated Proofs of Equality Problems in Overbeek's Competition. J. Autom. Reason. 11(3): 333-351 (1993) - [c22]Xin Hua, Hantao Zhang:
Formal Semantics of VHDL for Verification of Circuit Designs. ICCD 1993: 446-449 - [c21]Hantao Zhang:
A Case Study of Completion Modulo Distributivity and Abelian Groups. RTA 1993: 32-46 - 1992
- [c20]Hantao Zhang, Xin Hua:
Proving the Chinese Remainder Theorem by the Cover Set Induction. CADE 1992: 431-445 - [c19]Xin Hua, Hantao Zhang:
FRI: Failure-Resistant Induction in RRL. CADE 1992: 691-695 - [c18]Hantao Zhang:
Herky: High Performance Rewriting in RRL. CADE 1992: 696-700 - [c17]Hantao Zhang:
Proving Group Isomorphism Theorems (Extended Abstract). CTRS 1992: 302-306 - [c16]Hantao Zhang:
Implementing Contextual Rewriting. CTRS 1992: 363-377 - [c15]Xin Hua, Hantao Zhang:
Axiomatic semantics of a hardware specification language. Great Lakes Symposium on VLSI 1992: 183-190 - 1991
- [j7]Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang:
Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28(4): 311-350 (1991) - [j6]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Automating Inductionless Induction Using Test Sets. J. Symb. Comput. 11(1/2): 81-111 (1991) - [c14]Hantao Zhang, Angshuman Guha, Xin Hua:
Using Algebraic Specification in Floyd-Hoare Assertions. AMAST 1991: 350-362 - [c13]Deepak Kapur, Hantao Zhang:
A Case Study of the Completion Procedure: Proving Ring Commutativity Problems. Computational Logic - Essays in Honor of Alan Robinson 1991: 360-394 - 1990
- [j5]Hantao Zhang:
Automated Proof of Ring Commutativity Problems by Algebraic Methods. J. Symb. Comput. 9(4): 423-427 (1990) - [j4]Hantao Zhang, Deepak Kapur:
Unnecessary Inferences in Associative-Commutative Completion Procedures. Math. Syst. Theory 23(3): 175-206 (1990) - [c12]Deepak Kapur, G. Sivakumar, Hantao Zhang:
A New Method for Proving Termination of AC-Rewrite Systems. FSTTCS 1990: 133-148 - [c11]Hantao Zhang:
Approximate Reasoning in Strength Logic. ISMVL 1990: 262-269
1980 – 1989
- 1989
- [c10]Hantao Zhang, Deepak Kapur:
Consider Only General Superpositions in Completion Procedures. RTA 1989: 513-527 - [c9]Deepak Kapur, Hantao Zhang:
An Overview of Rewrite Rule Laboratory (RRL). RTA 1989: 559-563 - 1988
- [j3]Deepak Kapur, Hantao Zhang:
Proving Equivalence of Different Axiomatizations of Free Groups. J. Autom. Reason. 4(3): 331-352 (1988) - [j2]Hans-Jürgen Bürckert, Alexander Herold, Deepak Kapur, Jörg H. Siekmann, Mark E. Stickel, Michael Tepp, Hantao Zhang:
Opening the AC-Unification Race. J. Autom. Reason. 4(4): 465-474 (1988) - [c8]Hantao Zhang, Deepak Kapur:
First-Order Theorem Proving Using Conditional Rewrite Rules. CADE 1988: 1-20 - [c7]Hantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy:
A Mechanizable Induction Principle for Equational Specifications. CADE 1988: 162-181 - [c6]Deepak Kapur, Hantao Zhang:
RRL: A Rewrite Rule Laboratory. CADE 1988: 768-769 - 1987
- [j1]Deepak Kapur, Paliath Narendran, Hantao Zhang:
On Sufficient-Completeness and Related Properties of Term Rewriting Systems. Acta Informatica 24(4): 395-415 (1987) - 1986
- [c5]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Proof by Induction Using Test Sets. CADE 1986: 99-117 - [c4]Deepak Kapur, G. Sivakumar, Hantao Zhang:
RRL: A Rewrite Rule Laboratory. CADE 1986: 691-692 - [c3]Deepak Kapur, Paliath Narendran, Hantao Zhang:
Complexity of Sufficient-Completeness. FSTTCS 1986: 426-442 - 1985
- [c2]Hantao Zhang, Jean-Luc Rémy:
Contextual Rewriting. RTA 1985: 46-62 - 1984
- [c1]Jean-Luc Rémy, Hantao Zhang:
REVEUR 4: A System for Validating Conditional Algebraic Specifications of Abstract Data Types. ECAI 1984: 373-382
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
