Direct deductive computation on discourse representation structures

DOI10.1007/BF00985573zbMath0810.03021MaRDI QIDQ4312345

Dov M. Gabbay, Uwe Reyle

Publication date: 10 November 1994

Published in: Linguistics and Philosophy (Search for Journal in Brave)

zbMATH Keywords

discourse representationrun time Skolemization

Mathematics Subject Classification ID

Related Items (4)

Computation with run time skolemisation (N-Prolog part 3) ⋮ A calculus for first order discourse representation structures ⋮ Reasoning without believing: on the mechanisation of presuppositions and partiality ⋮ Projection: A unification procedure for tableaux in Conceptual Graphs

Cites Work

• A compact representation of proofs
• A natural deduction system for discourse representation theory
• A calculus for first order discourse representation structures
• N-Prolog: An extension of Prolog with hypothetical implications. I.
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
• A Deductive Approach to Program Synthesis
• Syntax and semantics of questions
• Computation with run time skolemisation (N-Prolog part 3)
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Direct deductive computation on discourse representation structures