Cited By
View all- Mylopoulos JWang HKramer B(2018)KnowbelIEEE Expert: Intelligent Systems and Their Applications10.1109/64.1930518:1(17-24)Online publication date: 20-Dec-2018
Epikit: a library of subroutines supporting declarative representations and reasoning
Abstract
Epikit is a library of Common Lisp subroutines intended for use in the construction of programs that operate on databases encoded in Knowledge Interchange Format (KIF).The goals of Epikit are to provide a robust, portable, and efficient library of subroutines to support representation and reasoning methods based on Logic. The focus primarily is on first-order logic (FOL) with extensions to support meta-knowledge, i.e., knowledge about other expressions in the KIF language, and extensions to support the specification and interpretation of programs for intelligent control applications.
References
[1]
The Epikit Overview, Epistemics, Inc., Palo Alto, 1990.
[2]
Epikit Manual Version 1.4, Epistemics, Inc., Palo Alto, 1990.
[3]
Genesereth, M. "An Overview of Meta-Level Architecture," Proceedings of the National Conference on Artificial Intelligence, pp. 119--124, 1983.
[4]
Genesereth, M. et al "Knowledge Interchange Format: Version 2.1: Reference Manual," Logic-90--4, Computer Science Department, Stanford University, July 1990.
[5]
Russell, S. "The Compleat Guide to MRS," STAN-CS-85--1080, Computer Science Department, Stanford University, June 1985.
Index Terms
- Epikit: a library of subroutines supporting declarative representations and reasoning
Recommendations
Intuitionistic Trilattice Logics
We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN3 introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and ...
Completeness and decidability of converse PDL in the constructive type theory of Coq
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and ProofsThe completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1991 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1991
Published in SIGAI Volume 2, Issue 3
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 131Total Downloads
- Downloads (Last 12 months)34
- Downloads (Last 6 weeks)5
Reflects downloads up to 31 Dec 2024
Other Metrics
Citations
Cited By
View all- Mylopoulos JWang HKramer B(2018)KnowbelIEEE Expert: Intelligent Systems and Their Applications10.1109/64.1930518:1(17-24)Online publication date: 20-Dec-2018
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in