Automatic theorem proving. II

A. A. Voronkov; A. I. Degtyarev

doi:10.1007/bf01078915

Automatic theorem proving. II

Cybernetics ◽

10.1007/bf01078915 ◽

1988 ◽

Vol 23 (4) ◽

pp. 547-556 ◽

Cited By ~ 1

Author(s):

A. A. Voronkov ◽

A. I. Degtyarev

Keyword(s):

Theorem Proving ◽

Automatic Theorem Proving ◽

Automatic Theorem

Download Full-text

Logic Control via Automatic Theorem Proving: COCOLOG Fragments Implemented in Blitzensturm 5.0

1993 American Control Conference ◽

10.23919/acc.1993.4793060 ◽

1993 ◽

Cited By ~ 1

Author(s):

P.E. Caines ◽

T. Mackling ◽

Y.J. Wei

Keyword(s):

Theorem Proving ◽

Automatic Theorem Proving ◽

Logic Control ◽

Automatic Theorem

Download Full-text

Examples of automatic theorem proving a real geometry

Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '94 ◽

10.1145/190347.190354 ◽

1994 ◽

Cited By ~ 2

Author(s):

Ahmed Guergueb ◽

Jean Mainguené ◽

Marie-Françoise Roy

Keyword(s):

Theorem Proving ◽

Automatic Theorem Proving ◽

Real Geometry ◽

Automatic Theorem

Download Full-text

Pirotte, A., Automatic Theorem Proving Basedon Resolution (Automatic Programming), Volume 7, Part 4 (1973). IV. 201–266 S. Oxford/New York/Toronto/Sydney/Braunschweig 1973. Pergamon Press. Preis brosch. £ 2.00

ZAMM ‐ Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik ◽

10.1002/zamm.19740541027 ◽

1974 ◽

Vol 54 (10) ◽

pp. 748-748

Author(s):

J. Metz

Keyword(s):

New York ◽

Theorem Proving ◽

Automatic Programming ◽

Automatic Theorem Proving ◽

Automatic Theorem

Download Full-text

Refinements to depth-first iterative-deepening search in automatic theorem proving

Artificial Intelligence ◽

10.1016/0004-3702(89)90011-8 ◽

1989 ◽

Vol 41 (2) ◽

pp. 223-235

Author(s):

Xumin Nie ◽

David A. Plaisted

Keyword(s):

Theorem Proving ◽

Automatic Theorem Proving ◽

Automatic Theorem

Download Full-text

Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving

Word Problems - Decision Problems and the Burnside Problem in Group Theory - Studies in Logic and the Foundations of Mathematics ◽

10.1016/s0049-237x(08)71923-2 ◽

1973 ◽

pp. 609-639 ◽

Cited By ~ 14

Author(s):

Lawrence Wos ◽

George Robinson

Keyword(s):

Theorem Proving ◽

Automatic Theorem Proving ◽

Maximal Models ◽

Automatic Theorem

Download Full-text

Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27813-9_36 ◽

2004 ◽

pp. 457-461 ◽

Cited By ~ 34

Author(s):

Thomas Ball ◽

Byron Cook ◽

Shuvendu K. Lahiri ◽

Lintao Zhang

Keyword(s):

Theorem Proving ◽

Predicate Abstraction ◽

Automatic Theorem Proving ◽

Abstraction Refinement ◽

Automatic Theorem

Download Full-text

Semantic Trees in Automatic Theorem-Proving

Automation of Reasoning ◽

10.1007/978-3-642-81955-1_13 ◽

1983 ◽

pp. 217-232 ◽

Cited By ~ 5

Author(s):

R. Kowalski ◽

P. J. Hayes

Keyword(s):

Theorem Proving ◽

Automatic Theorem Proving ◽

Automatic Theorem

Download Full-text

Automated Design of Multiple-Valued Logic Circuits by Automatic Theorem Proving Techniques

IEEE Transactions on Computers ◽

10.1109/tc.1983.1676328 ◽

1983 ◽

Vol C-32 (9) ◽

pp. 785-798 ◽

Cited By ~ 11

Author(s):

Wojciechowski ◽

Wojcik

Keyword(s):

Theorem Proving ◽

Automated Design ◽

Logic Circuits ◽

Automatic Theorem Proving ◽

Multiple Valued Logic ◽

Automatic Theorem

Download Full-text

OR-ATP: An Operation Refinement Approach As a Process of Automatic Theorem Proving

Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007) ◽

10.1109/snpd.2007.253 ◽

2007 ◽

Author(s):

Shuaiqiang Wang ◽

Jiancheng Wan ◽

Jinkui Hou

Keyword(s):

Theorem Proving ◽

Automatic Theorem Proving ◽

Automatic Theorem

Download Full-text

ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)

International Journal of Foundations of Computer Science ◽

10.1142/s0129054114400267 ◽

2014 ◽

Vol 25 (08) ◽

pp. 1097-1110 ◽

Cited By ~ 3

Author(s):

DANIEL GOČ ◽

NARAD RAMPERSAD ◽

MICHEL RIGO ◽

PAVEL SALIMOV

Keyword(s):

Theorem Proving ◽

Triangular Lattice ◽

Automatic Theorem Proving ◽

Combinatorial Objects ◽

Letter Alphabet ◽

Automatic Sequences ◽

Motzkin Paths ◽

Automatic Theorem

In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible symmetric Motzkin paths and paths in ℤ not returning to the origin. This study can be extended to abelian unbordered words over an arbitrary alphabet and we derive expressions to compute the number of these words. In particular, over a 3-letter alphabet, the connection with paths in the triangular lattice is made. Finally, we characterize the lengths of the abelian unbordered factors occurring in the Thue–Morse word using some kind of automatic theorem-proving provided by a logical characterization of the k-automatic sequences.

Download Full-text