HiLog: A foundation for higher-order logic programming
From MaRDI portal
Publication:4036287
DOI10.1016/0743-1066(93)90039-JzbMATH Open0787.68017WikidataQ127570258 ScholiaQ127570258MaRDI QIDQ4036287FDOQ4036287
Authors: Weidong Chen, Michael Kifer, David S. Warren 
Publication date: 16 May 1993
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Recommendations
Cited In (36)
- Knowledge representation analysis of graph mining
- Kripke semantics for higher-order type theory applied to constraint logic programming languages
- The limits of fixed-order computation
- Answer Set Programming: A Primer
- Intensional First-Order Logic for P2P Database Systems
- Higher-order logic learning and \(\lambda\)Progol
- Functional-logic integration via minimal reciprocal extensions
- In praise of impredicativity: a contribution to the formalization of meta-programming
- Predicates as parameters in logic programming: a set-theoretic basis
- Metamodeling and metaquerying in \texttt{OWL 2 QL}
- The intricacies of three-valued extensional semantics for higher-order logic programs
- Title not available (Why is that?)
- A compositional typed higher-order logic with definitions
- On the algebraic structure of declarative programming languages
- Verifying termination and reduction properties about higher-order logic programs
- Semantics of templates in a compositional framework for building logics
- Logic Programming with Defaults and Argumentation Theories
- Title not available (Why is that?)
- Disjunctive logic programming with types and objects: the \(\mathrm{DLV}^{+}\) system
- Can HOLL outperform FOLL?
- Title not available (Why is that?)
- \(a\)-logic with arrows
- The F-logic approach for description languages
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Adding Metalogic Features to Knowledge Representation Languages*
- The complexity of higher-order queries
- A practical analysis of non-termination in large logic programs
- Equivalence of two fixed-point semantics for definitional higher-order logic programs
- Equivalence of two fixed-point semantics for definitional higher-order logic programs
- Extended RDF: computability and complexity issues
- Lightweight functional logic meta-programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The expressive power of higher-order Datalog
- A Survey of the Proof-Theoretic Foundations of Logic Programming
Uses Software
This page was built for publication: HiLog: A foundation for higher-order logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036287)
