The DOI matches its Crossref record, with a small difference in title or year; 26 of the 27 references it cites were found in a registry or an index.
A sensible least Herbrand semantics for untyped vanilla meta-programming and its extension to a limited form of amalgamation
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The non-ground representation has semantical problems.
“The non-ground representation also has semantical problems (although they were solved to some extent in [20,66,67]).”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [20]
Citations
Cites
Foundations of Logic Programming
Lloyd, J. (1984) · Symbolic Computation · doi:10.1007/978-3-642-96826-6 · Cited by 5,772
Foundations of Logic Programming
Lloyd, J. W. (1987) · Springer eBooks · doi:10.1007/978-3-642-83189-8 · Cited by 2,736
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,398
Sterling, L., Shapiro, E., & Garrett, R. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307074 · Cited by 1,101
First-Order Logic and Automated Theorem Proving
Fitting, M. (1996) · Springer eBooks · doi:10.1007/978-1-4612-2360-3 · Cited by 950
First-Order Logic and Automated Theorem Proving
Fitting, M. (1990) · Springer eBooks · doi:10.1007/978-1-4684-0357-2 · Cited by 334
Logic for improving integrity checking in relational data bases?
Nicolas, J.-M. (1982) · Acta Informatica · doi:10.1007/bf00263192 · Cited by 307
A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases
Bry, F., Decker, H., & Manthey, R. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19074-0_69 · Cited by 134
Partial Evaluation of Prolog Programs and its Application to Meta Programming.
Takeuchi, A., & Furukawa, K. (1986) · IFIP Congress · Cited by 110
Query evaluation in recursive databases: bottom-up and top-down reconciled
Bry, F. (1990) · Data & Knowledge Engineering · doi:10.1016/0169-023x(90)90017-8 · Cited by 95
Meta-level programming and knowledge representation
Bowen, K. A. (1985) · New Generation Computing · doi:10.1007/bf03037077 · Cited by 94
Problems and Promises of Computational Logic
Kowalski, R. (1990) · Springer eBooks · doi:10.1007/978-3-642-76274-1_1 · Cited by 67
Metainterpreters for expert system construction
STERLING, L. S., & Beer, R. D. (1989) · The Journal of Logic Programming · doi:10.1016/0743-1066(89)90034-4 · Cited by 67
Hill, P. M., & Lloyd, J. W. (1988) · The MIT Press eBooks · Cited by 56
Formal Methods in Artificial Intelligence
Ramsay, A. (1988) · Cited by 44
Transforming logic programs by specialising interpreters
Gallagher, J. P. (1986) · European Conference on Artificial Intelligence · Cited by 43
Integrity verification in knowledge bases
Bry, F., Manthey, R., & Martens, B. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55460-2_9 · Cited by 31
Self-citationFormal methods in artificial intelligence
Delahaye, J.-P. (1987) · Cited by 29
Richards, B. (1974) · Synthese · doi:10.1007/bf00877581 · Cited by 26
Hill, P., & Lloyd, J. (1991) · Cited by 22
A Simple Formulation of the Theory of Metalogic Programming.
Subrahmanian, V. S. (1988) · The MIT Press eBooks · Cited by 8
Directions for Meta-Programming.
Lloyd, J. W. (1988) · Future Generation Computer Systems · Cited by 8
Integrity Verification in Knowledge Bases
Bry, F., Manthey, R., & Martens, B. (1991) · doi:10.5282/ubm/epub.8512 · Cited by 7
Self-citationDenecker, M., Schreye, D. D., & Willems, Y. (1990) · Lirias · Cited by 5
Self-citationA perfect Herbrand semantics for untyped vanilla meta-programming
Martens, B., & Schreye, D. D. (1992) · International Conference on Logic Programming · Cited by 5
Self-citationMeta-programming for reordering literals in deductive databases
Träff, J. L., & Prestwich, S. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56282-6_19 · Cited by 2
Flagged first, then by citations
1 of the 27 references couldn’t be matched to a known paper.
Research works printed but not linked: 5
- K. A. Bowen and R. A. Kowalski. Amalgamating language and metalanguage in logic programming. In K. L. Clark and S.-A. Tärnlund, editors, Logic Programming, pages 153–172. Academic Press, 1982.
- H. Gallaire and C. Lasserre. Metalevel control for logic programs. In K. L. Clark and S.-A. Tärnlund, editors, Logic Programming, pages 173–185. Academic Press, 1982.
- P. M. Hill and J. W. Lloyd. Meta-programming for dynamic knowledge bases. Technical Report CS-88-18, Computer Science Department, University of Bristol, Great-Britain, 1988.
- J.-M. Nicolas. Logic for improving integrity checking in relational databases. Acta Informatica, 18(3):227–253, 1982.
- J. D. Ullman. Database and Knowledge-Base Systems, Volume 1. Computer Science Press, 1988.
Cited by
Sorted by citations
The s-semantics approach: Theory and applications
Bossi, A., Gabbrielli, M., Levi, G., & Martelli, M. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90026-4 · Cited by 126
Reflection principles in computational logic
Barklund, J. (2000) · Journal of Logic and Computation · doi:10.1093/logcom/10.6.743 · Cited by 60
Advanced Techniques for Logic Program Specialisation
Leuschel, M. (1997) · Lirias · Cited by 35
Why untyped nonground metaprogramming is not (much of) a problem
Martens, B., & de Schreye, D. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)00015-x · Cited by 23
Self-citationTowards creating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1995) · Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95 · doi:10.1145/215465.215598 · Cited by 16
Self-citationA metalogic programming approach to reasoning about time in knowledge bases
Sripada, S. M. (1993) · International Joint Conference on Artificial Intelligence · Cited by 13
Meta-variables in Logic Programming, or in Praise of Ambivalent Syntax
Apt, K. R., & Ben-Eliyahu, R. (1996) · Fundamenta Informaticae · doi:10.3233/fi-1996-281202 · Cited by 6
In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming
BRY, F. (2019) · Theory and Practice of Logic Programming · doi:10.1017/s1471068419000024 · Cited by 3
Semantics of meta-logic in an algebra of programs
Antonio Brogi, A., & Turini, F. (2002) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.1994.316063 · Cited by 3
S-semantics for logic programming: A retrospective look
Bossi, A. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.07.039 · Cited by 2
Gödel as a meta-language for composing logic programs
Antonio Brogi, A., & Contiero, S. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58792-6_23 · Cited by 2
Metadata
- Authors
- Schreye, D., & Martens, B.
- Affiliations
- KU Leuven (BE)
- ORCID
- Schreye, Danny
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1992
- Pages
- 192-204
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1546319926
- Cited by
- 10
- References
- 27
- FWCI
- 2.22
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
- Keywords
- amalgamation, language independence, range restriction, definite programs
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
