A Unifying Principle for Clause Elimination in First-Order Logic (bibtex)
by Benjamin Kiesl, Martin Suda
Reference:
A Unifying Principle for Clause Elimination in First-Order LogicBenjamin Kiesl, Martin SudaAutomated Deduction - CADE 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings (Leonardo de Moura, ed.), volume 10395 of Lecture Notes in Computer Science, pages 274-290, 2017, Springer.
Bibtex Entry:
@inproceedings{DBLP:conf/cade/Kiesl017,
  author    = {Benjamin Kiesl and
               Martin Suda},
  title     = {A Unifying Principle for Clause Elimination in First-Order Logic},
  booktitle = {Automated Deduction - {CADE} 26 - 26th International Conference on
               Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings},
  pages     = {274--290},
  year      = {2017},
  editor    = {Leonardo de Moura},
  series    = {Lecture Notes in Computer Science},
  volume    = {10395},
  publisher = {Springer},
  url       = {https://doi.org/10.1007/978-3-319-63046-5_17},
  doi       = {10.1007/978-3-319-63046-5_17},
  timestamp = {Wed, 12 Jul 2017 10:22:36 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cade/Kiesl017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
Powered by bibtexbrowser