Keyword

refutation completeness

Description: A property of a logical proof procedure whereby every refutable set of premises can be shown to be inconsistent by the procedure.
OpenAlex ID: keywords/refutation-completeness
2005 · Rainer Manthey, François Bry · Springer eBooks · 282
1970 · D. W. Loveland · Lecture notes in mathematics · 138
1995 · Robert Nieuwenhuis, Albert Rubio · Journal of Symbolic Computation · 127
1995 · Adel Bouhoula, Micha�l Rusinowitch · Journal of Automated Reasoning · 104
2012 · Allen Van Gelder · Lecture notes in computer science · 96
1996 · Jean-Paul Billon · Lecture notes in computer science · 57
2020 · Ahmed Bhayat, Giles Reger · Lecture notes in computer science · 49
1998 · François Bry, Sunna Torge · Lecture notes in computer science · 46
1989 · Jean H Gallier, Stan Raatz · The Journal of Logic Programming · 41
1993 · Adel Bouhoula, Michaël Rusinowitch · OpenGrey (Institut de l'Information Scientifique et Technique) · 27
1991 · Leo Bachmair, Harald Ganzinger · Lecture notes in computer science · 27
1993 · Hans Kleine Bu¨ning · Theoretical Computer Science · 26
2005 · Leo Bachmair, Harald Ganzinger · Springer eBooks · 24
2013 · Alsinet, Teresa, Godo, Lluis, et al. · arXiv (Cornell University) · 23
1973 · Lawrence Wos, George Robinson · Studies in logic and the foundations of mathematics · 22
2009 · Fernando Orejas, Hartmut Ehrig, et al. · Formal Aspects of Computing · 18
1991 · Francois Bronsard, Uday S. Reddy · Lecture notes in computer science · 18
1986 · Norbert Eisinger · Lecture notes in computer science · 18
2002 · Adel Bouhoula, Michaël Rusinowitch · Theoretical Computer Science · 16
1971 · C. L. Chang, J. R. Slagle · Journal of the ACM · 16
1989 · Leo Bachmair · Lecture notes in computer science · 14
Works count: 103
Citation count: 1,803
Year
Topic
Type