A family of goal directed theorem provers based on conjunction and implication. I
From MaRDI portal
(Redirected from Publication:1181711)
Recommendations
Cites work
- Computation with run time skolemisation (N-Prolog part 3)
- scientific article; zbMATH DE number 512976 (Why is no real title available?)
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
- Near-Horn prolog and beyond
- Semantical investigations in Heyting's intuitionistic logic
Cited in
(9)- Theorem proving for intensional logic
- Analyzing rule sets for the calculation of banking fees by a theorem prover with constraints
- Theorem proving for conditional logics: CondLean and GOALDUCK
- scientific article; zbMATH DE number 4104409 (Why is no real title available?)
- Computation with run time skolemisation (N-Prolog part 3)
- Towards structurally-free theorem proving
- scientific article; zbMATH DE number 1543301 (Why is no real title available?)
- A decision procedure for propositional N-Prolog
- Detecting non-provable goals
This page was built for publication: A family of goal directed theorem provers based on conjunction and implication. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181711)