Representations of the language recognition problem for a theorem prover
From MaRDI portal
Publication:4770508
DOI10.1007/BF00977256zbMath0284.68067OpenAlexW2006755191MaRDI QIDQ4770508
Gordon J. VanderBrug, Jack Minker
Publication date: 1974
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00977256
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extracting information from resolution proof trees
- Finding resolution proofs and using duplicate goals in AND/OR trees
- On certain formal properties of grammars
- State-space problem-reduction, and theorem proving—some relationships
- A Machine-Oriented Logic Based on the Resolution Principle
- Recognition and parsing of context-free languages in time n3
- The Unit Proof and the Input Proof in Theorem Proving
- A Computing Procedure for Quantification Theory
This page was built for publication: Representations of the language recognition problem for a theorem prover
