The DOI matches its Crossref record.
The Art of Prolog
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?
In the citing paper
“Operationally, the if-then-else of ITE-Prolog behaves like the corresponding construct in Prolog [88,73].”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [88]
Citations
Cited by
Sorted by citations
Items 801–900 of 1,000
Agenda control for heterogeneous reasoners
Stolle, R., Hogan, A., & Bradley, E. (2003) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2003.07.001 · Cited by 2
Knuutila, T. (1992) · Software Practice and Experience · doi:10.1002/spe.4380220302 · Cited by 2
An intelligent system for discovering mathematical models for financial time series prediction
Castillo, O., & Melín, P. (2002) · doi:10.1109/tencon.1994.369305 · Cited by 2
On Termination of Meta-programs
Serebrenik, A., & Schreye, D. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45653-8_36 · Cited by 3
Building embedded languages and expert system shells in Prolog
Yalçinalp, L. Ü., & STERLING, L. S. (2002) · Proceedings - International Conference on Tools with Artificial Intelligence, TAI · doi:10.1109/tai.1990.130310 · Cited by 2
Self-citationSemantics-based information valuation
al-Saffar, S., & Heileman, G. L. (2008) · International IEEE Conference on Intelligent Systems (IS) · doi:10.1109/is.2008.4670438 · Cited by 2
A Generic, Collaborative Framework for Interval Constraint Solving: Thesis
Fernández, A. J. (2004) · AI Communications · Cited by 2
TARILAN: an embedded functional data processing language
Bosschere, K. D. (1998) · Journal of Systems and Software · doi:10.1016/s0164-1212(98)10025-0 · Cited by 2
Towards the automated debugging and maintenance of logic-based requirements models
McCluskey, T. L., & West, M. M. (2002) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.1998.732591 · Cited by 2
EQL: the language and its implementation
Jayaraman, B., & Gupta, G. (1989) · IEEE Transactions on Software Engineering · doi:10.1109/32.24730 · Cited by 2
Assertional Reasoning about Dynamic Systems
Cunningham, H. C., Roman, G.-C., & Plun, J. Y. (1993) · Cited by 2
Regulation management and logic programming
Koster, A., & Parker, D. S. (1990) · Software Practice and Experience · doi:10.1002/spe.4380200109 · Cited by 2
Scalable and accurate knowledge discovery in real world databases
Scholz, M. (2007) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-872 · Cited by 2
What is Logic Programming good for in Software Engineering?
Ciancarini, P., & Levi, G. (1993) · Series on software engineering and knowledge engineering · doi:10.1142/9789812798039_0005 · Cited by 2
Knowledge Refactoring for Program InductionPreprint
Dumančić, S., & Cropper, A. (2020) · arXiv (Cornell University) · Cited by 2
Expanding Transformation: A Basis for Correctness Verification of Rewriting Rules
Nantajeewarawat, E., Akama, K., & Koike, H. (2007) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2007.p0478 · Cited by 2
Constructing Provably Correct Logic Programs
Jain, A., Kirschenbaum, M., & STERLING, L. S. (1994) · Cited by 2
Self-citationKnowledge-based design of ergonomic lighting for underground scenarios
Burgard, W., Lüttringhaus-Kappel, S., & Plümer, L. (2005) · Springer eBooks · doi:10.1007/bfb0025001 · Cited by 1
Declarative Constraint Programming
Fernández, A. J. (2006) · INTELIGENCIA ARTIFICIAL · doi:10.4114/ia.v9i27.853 · Cited by 1
Spatialization of the Semantic Web
Karmacharya, A., Cruz, C., & Boochs, F. (2012) · InTech eBooks · doi:10.5772/38399 · Cited by 1
Data Modeling of Knowledge Rules: An Oracle Prototype
Kaula, R. (2012) · Journal of Software · doi:10.4304/jsw.7.12.2857-2865 · Cited by 1
An augmented Prolog programming environment for tutoring applications
Lee, M.-C. (1990) · International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE) · doi:10.1145/98894.98884 · Cited by 1
PAN: A portable, parallel Prolog: Its design, realisation and performance
Xirogiannis, G., & Taylor, H. (2002) · New Generation Computing · doi:10.1007/bf03037372 · Cited by 1
Netlog: a logic query language for network model databases
Greco, S., Palopoli, L., & Rullo, P. (1991) · Data & Knowledge Engineering · doi:10.1016/0169-023x(91)90004-h · Cited by 1
The accepting power of unary string logic programs
Matsushita, T., & Runciman, C. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00011-6 · Cited by 1
Optimal number of levels for a multilevel clustering method
Babu, V. S. S. S. (1990) · Pattern Recognition Letters · doi:10.1016/0167-8655(90)90011-p · Cited by 1
The Intellectual Training Environment for Prolog Programming Language
Pelin, S., & Moldova, R. (2007) · RePEc: Research Papers in Economics · Cited by 1
Aprendizaje Incremental en Sistemas Multi-Agente BDI
Hern, G. O., de Tesis, D., & Hern, A. G. (2007) · Cited by 1
The quest for runware: on compositional, executable and intuitive models
Harel, D., & Marron, A. (2012) · Software & Systems Modeling · doi:10.1007/s10270-012-0258-8 · Cited by 1
A Comparative Study of Programming Agents in POSH and GOAL
Korstanje, R., Brom, C., Gemrot, J., et al. (2016) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0005799601920203 · Cited by 1
A constraint programming-based library for the vehicle routing problem
Riera, D., Juan, A. A., Guimarans, D., et al. (2009) · Cited by 1
DeSymbol: an interpretive tool for symbolic logic
Provine, D. F., & Tinkham, N. L. (2008) · Journal of computing sciences in colleges · Cited by 1
Ovsiannikova, P., Pakonen, A., Muromsky, D., Kobzev, M., Dubinin, V. N., & Vyatkin, V. (2024) · IEEE Open Journal of the Industrial Electronics Society · doi:10.1109/ojies.2024.3413568 · Cited by 1
Die Logik oder Die Kunst des Programmierens
Specker, E. P. (1990) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9259-9_31 · Cited by 1
Declarative Compilation for Constraint Logic Programming
Arias, E. J. G., Lipton, J., & Mariño, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-17822-6_17 · Cited by 1
The Logic Programming Paradigm
Gabbrielli, M., & Martini, S. (2010) · Undergraduate topics in computer science · doi:10.1007/978-1-84882-914-5_12 · Cited by 1
A Prototype for General Planning
Azevedo, F. A. (2005) · doi:10.1109/epia.2005.341258 · Cited by 1
“For that, we developed a prototype system, PLAN, based on rewriting (to express state transitions) [1] and implemented with logic programming [12] (in Prolog [ 17 ]), to easily handle non-determinism.”
MethodA constraint logic programming approach for generating all perfect matchings
Harary, F., & Gupta, G. (2002) · Applied Mathematics Letters · doi:10.1016/s0893-9659(02)00071-x · Cited by 1
Computational Infrastructure for Telehealth
Lehocki, F., Kossaczký, I., Homola, M., et al. (2017) · Health information science · doi:10.1007/978-3-319-44981-4_12 · Cited by 1
PROLOG — Logik-orientierte Programmierung (3)
Stoyan, H. (1988) · Studienreihe Informatik · doi:10.1007/978-3-642-87954-8_10 · Cited by 1
The compilation of SL, a set-based logic language for generic parallel architectures.
Succi, G., & Uhrik, C. (1997) · Cited by 1
Goos, G., Dietrich, R., & Kursawe, P. (1987) · Springer eBooks · doi:10.1007/978-3-642-88719-2_8 · Cited by 1
Formal Specification of Discrete Systems by Active Predicates and Dynamic Constraints
Bolognesi, T., & Bracciali, A. (1999) · Formal Methods for Open Object-Based Distributed Systems · doi:10.1007/978-0-387-35562-7_13 · Cited by 1
Characterisations of Termination in Logic Programming
Pedreschi, D., Ruggieri, S., & Smaus, J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25951-0_12 · Cited by 1
A module system for meta-programming
Hill, P. M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58792-6_24 · Cited by 1
Learning Logic Programs with Local Variables from Positive Examples
Rao, M. R. K. K., & Sattar, A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46695-9_41 · Cited by 1
CLP(PB) - A Meta-Interpreter in CLP(R)
Barth, P. M. (1992) · MPG.PuRe (Max Planck Society) · Cited by 1
A Linda-based runtime system for a distributed logic language
Ciancarini, P. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57502-2_58 · Cited by 1
Pruning infinite failure branches in programs with occur-check
Neumerkel, U. (2005) · Springer eBooks · doi:10.1007/bfb0013059 · Cited by 1
User's Functions in Standard Prolog.
Ásványi, T. (2003) · Cited by 1
MODIFYING INTENSIONAL LOGIC KNOWLEDGE
Leone, N., Palopoli, L., & Romeo, M. (1994) · Fundamenta Informaticae · doi:10.3233/fi-1994-2132 · Cited by 1
KNOWLEDGE REPRESENTATION APPROACH TO CLOSED LOOP CONTROL SYSTEM - A TANK SYSTEM CASE-STUDY
Rato, L. M., Rodrigues, I. P., & Gomes, R. (2005) · International Conference on Informatics in Control, Automation and Robotics (ICINCO) · doi:10.5220/0001186301130118 · Cited by 1
Reflection as a tool for integration: an exercise in procedural introspection
Ghislanzoni, R., Spampinato, L., & Tornielli, G. (1987) · International Joint Conference on Artificial Intelligence · Cited by 1
A reflective strategic problem solving model
Charlton, P. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56804-2_57 · Cited by 1
Of Using Constraint Logic Programming for Design of Mechanical Parts
STERLING, L. S. (1993) · Intelligent Systems · doi:10.1007/978-1-4615-2836-4_6 · Cited by 1
Self-citationA VLSI Engine for Structured Logic Programming
Civera, P., Lamma, E., Mello, P., et al. (1991) · Springer eBooks · doi:10.1007/978-1-4615-3752-6_11 · Cited by 1
Learning Hereditary and Reductive Prolog Programs from Entailment
Hussain, S., & Rao, M. R. K. K. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04020-7_58 · Cited by 1
Skeletons and techniques for the systematic development of constraint logic programs
Michaylov, S. (2002) · Proceedings - International Conference on Tools with Artificial Intelligence, TAI · doi:10.1109/tai.1994.346503 · Cited by 1
Fehlertolerantes Koordinieren verteilter autonomer Dienste
Kühn, E. (1993) · Informatik aktuell · doi:10.1007/978-3-642-78565-8_26 · Cited by 1
Bry, F. (1990) · doi:10.5282/ubm/epub.8509 · Cited by 1
Automatic Extraction of Logic Program Transformations from Examples
Vasconcelos, W. W., & Aragão, M. A. T. (2000) · Lecture notes in computer science · doi:10.1007/10720076_21 · Cited by 1
Evolution Scenarios for Rule-Based Implementations of Language-Based Functionality
Lämmel, R. (2005) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2004.09.039 · Cited by 1
Subtraction problem generating: Two approaches
Шевченко, І., & Nakayama, K. (1991) · Computers & Education · doi:10.1016/0360-1315(91)90017-l · Cited by 1
A full theorem-prover under uncertainty
Papakonstantinou, G., & Panayiotopoulos, T. (1993) · Journal of Intelligent & Robotic Systems · doi:10.1007/bf01257816 · Cited by 1
Compilation and evaluation of linear mutual recursions
Han, J. (1993) · Information Sciences · doi:10.1016/0020-0255(93)90043-l · Cited by 1
Dynamic composition of parameterised logic modules
Antonio Brogi, A., Renso, C., & Turini, F. (1999) · Computer Languages · doi:10.1016/s0096-0551(00)00006-0 · Cited by 1
Formal reasoning in intelligent database systems
Lee, S.-J. (1995) · Applied Intelligence · doi:10.1007/bf00880011 · Cited by 1
Aspect-oriented Prolog in a language processing context
Lohmann, W., Riedewald, G., & Wachsmuth, G. H. (2008) · IET Software · doi:10.1049/iet-sen:20070064 · Cited by 1
Notes Towards a Semantics for Proof-search
Pym, D. J. (2000) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)01132-1 · Cited by 1
Chang, B.-M., Choe, K.-M., & Giacobazzi, R. (1994) · ACM Symposium on Applied Computing · doi:10.1145/326619.326788 · Cited by 1
Episode analysis: A practical approach for temporal reasoning in automated processes
Parthasarathy, S. (1995) · Engineering Applications of Artificial Intelligence · doi:10.1016/0952-1976(94)00045-o · Cited by 1
Real-time reasoning with PROLOG
Yi, C., & Graham, S. (1990) · doi:10.1145/99412.99437 · Cited by 1
Lazy List Comprehension in Logic Programming
Elbl, B. (2002) · Journal of Logic and Computation · doi:10.1093/logcom/12.5.747 · Cited by 1
Requirements for an imperative language to host logic programming in a seamless way
Callegarin, G. (1996) · ACM SIGPLAN Notices · doi:10.1145/242604.242619 · Cited by 1
Prolog dialects: a deja vu of BASICs
Sosnowski, R. A. (1987) · ACM SIGPLAN Notices · doi:10.1145/24900.24903 · Cited by 1
Metaknowledge reasoning in civil engineering expert systems
Oki, A. A., & Smith, D. L. (1991) · Computers & Structures · doi:10.1016/0045-7949(91)90450-z · Cited by 1
Termination of well-typed logic programs
Bossi, A., Cocco, N., & Rossi, S. (2001) · ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/773184.773193 · Cited by 1
Reporting Failures in Functional Logic Programs
Hanus, M. (2007) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2007.01.002 · Cited by 1
The ontological status of computers or what is a computer?
Kelly, J. (1992) · AI & Society · doi:10.1007/bf02472784 · Cited by 1
A knowledge‐based approach to domain‐specialized information agents
Loke, S. W., STERLING, L. S., & Sonenberg, L. (1999) · Internet Research · doi:10.1108/10662249910264909 · Cited by 1
Self-citationCicekli, I. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(97)00075-7 · Cited by 1
Using a Prolog meta-programming approach for a blackboard application
Schwartz, D. G., & STERLING, L. S. (1993) · ACM SIGAPP Applied Computing Review · doi:10.1145/152535.152542 · Cited by 1
Self-citationLower bounds for the lengths of refutations
Ko, H.-P., McAllester, D., & Nadel, M. E. (1993) · The Journal of Logic Programming · doi:10.1016/0743-1066(93)90008-5 · Cited by 1
RASP: a resource allocator for software projects
Bertazzoni, C., & Giannotti, F. (1990) · International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE) · doi:10.1145/98894.98907 · Cited by 1
A practical approach to semantic configuration management
Moriconi, M. (1989) · doi:10.1145/75308.75321 · Cited by 1
Intelligent Fril/SQL interrogator
Xie, D., & Baldwin, J. F. (2007) · International Journal of Intelligent Systems · doi:10.1002/int.20197 · Cited by 1
The Logic Programming Paradigm and Prolog
Mitchell, J. C. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804175.016 · Cited by 1
Use of unit clauses and clause splitting in automatic deduction
Lee, S.-J., & Plaisted, D. A. (2003) · doi:10.1109/icci.1992.227667 · Cited by 1
Coullard, C. R., & Fourer, R. (1996) · doi:10.1109/hicss.1996.495425 · Cited by 1
From alternations to ordered rules : a system for learning derivational phonology
Simpson, M. L. (2010) · Spectrum Research Repository (Concordia University) · Cited by 1
ORTOGRAFIA CATALANA I LINGÜÍSTICA COMPUTACIONAL
Casacuberta, J. T. I., & Manyà, F. (1993) · Dialnet (Universidad de la Rioja) · Cited by 1
Johnson, S. (2000) · doi:10.15760/etd.2658 · Cited by 1
Set notation as a language to specify data transformation programs
Abbott, R. (1989) · Software Practice and Experience · doi:10.1002/spe.4380190607 · Cited by 1
Effective realization of recursive procedures in logic programs
Chen, A. C., & Wu, C.-L. (2003) · International Phoenix Conference on Computers and Communications (IPCCC) · doi:10.1109/pccc.1989.37406 · Cited by 1
Inverse computation and the Universal Resolving Algorithm
Abramov, S., & Glück, R. (2001) · Wuhan University Journal of Natural Sciences · doi:10.1007/bf03160224 · Cited by 1
On the Relations between Acceptable Programs and Stratifiable Classes
Protti, F., & Zaverucha, G. (1998) · Lecture notes in computer science · doi:10.1007/10692710_15 · Cited by 1
Inductive logic programming based on genetic algorithm
Yamamoto, K., Naito, S., & Itoh, M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60688-2_49 · Cited by 1
Proceedings of the Second Dynamic Aspects Workshop (DAW05)
Filman, R. E., Haupt, M., & Hirschfeld, R. (2005) · Cited by 1
Generating Polytope Intersection Configurations from a Symbolic Description Using CLP(ℜ)
Radack, G. M., & Andersson, M. J. (1993) · Intelligent Systems · doi:10.1007/978-1-4615-2836-4_10 · Cited by 1
Nicht-objektzentrierte Repräsentationsformate
Reimer, U. (1991) · Vieweg+Teubner eBooks · doi:10.1007/978-3-663-05970-7_2 · Cited by 1
Metadata
- Authors
- Sterling, L., Shapiro, E., & Garrett, R.
- Affiliations
- SAIC 5400 Jeffery Ave. West Palm Beach, FL 33047
- Venue
- IEEE Expert
- Published
- 1987-06
- Volume
- 2
- Issue
- 2
- Pages
- 106-107
- ISSN
- 0885-9000 (ISSN-L)
- 2374-9407
- OpenAlex
- W2023578426
- Semantic Scholar
- 85e31fa56b166fe4960f8fc27a55a2f242052f72
- Cited by
- 1,101
- References
- 0
- Citations by year
- 2024: 2 · 2022: 1 · 2021: 8 · 2020: 7 · 2019: 8 · 2018: 7 · 2017: 3 · 2016: 9 · 2015: 10 · 2014: 13 · 2013: 10 · 2012: 17
- Type
- book review
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Expert (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Keywords
- Prolog, logic programming, programming languages, declarative programming
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