Direct deductive computation on discourse representation structures
From MaRDI portal
Recommendations
Cites work
- A calculus for first order discourse representation structures
- A compact representation of proofs
- A Deductive Approach to Program Synthesis
- A Machine-Oriented Logic Based on the Resolution Principle
- A natural deduction system for discourse representation theory
- Computation with run time skolemisation (N-Prolog part 3)
- scientific article; zbMATH DE number 49746 (Why is no real title available?)
- scientific article; zbMATH DE number 193652 (Why is no real title available?)
- scientific article; zbMATH DE number 3546719 (Why is no real title available?)
- scientific article; zbMATH DE number 3557754 (Why is no real title available?)
- scientific article; zbMATH DE number 1028825 (Why is no real title available?)
- scientific article; zbMATH DE number 3222098 (Why is no real title available?)
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
- N-Prolog: An extension of Prolog with hypothetical implications. I.
- Syntax and semantics of questions
Cited in
(7)- A natural deduction system for discourse representation theory
- A calculus for first order discourse representation structures
- scientific article; zbMATH DE number 28363 (Why is no real title available?)
- Computation with run time skolemisation (N-Prolog part 3)
- scientific article; zbMATH DE number 1794700 (Why is no real title available?)
- Reasoning without believing: on the mechanisation of presuppositions and partiality
- Projection: a unification procedure for tableaux in conceptual graphs
This page was built for publication: Direct deductive computation on discourse representation structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312345)