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 701–800 of 1,000
Concurrency and communication: Choices in implementing the coordination language LO
Bourgois, M., Andreoli, J., & Pareschi, R. (2005) · Springer eBooks · doi:10.1007/bfb0017535 · Cited by 3
Specialising meta-level compositions of logic programs
Antonio Brogi, A., & Contiero, S. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62718-9_16 · Cited by 3
Applications of logic programming in language analysis
Eltantawi, M. R. A., & Maresca, P. (1994) · Engineering Applications of Artificial Intelligence · doi:10.1016/0952-1976(94)90008-6 · Cited by 3
Computational Dialogic Defeasible Reasoning
Causey, R. L. (2003) · Argumentation · doi:10.1023/a:1026342520498 · Cited by 3
A concurrent lambda-calculus with promises and futures
Schwinghammer, J. (2002) · Publications of the UdS (Saarland University) · doi:10.22028/d291-25773 · Cited by 3
Efficient Interval Linear Equality Solving in Constraint Logic Programming
Chiu, C.-K., & Lee, J. H. M. (2002) · Reliable Computing · doi:10.1023/a:1014754106275 · Cited by 3
A tour advisory system using a logic programming approach
Stamatopoulos, P., Karali, I., & Halatsis, C. (1993) · ACM SIGAPP Applied Computing Review · doi:10.1145/152535.152539 · Cited by 3
Concurrent modeling language (CML) for discrete process modeling, simulation and control
Ben‐Arieh, D. (1992) · Journal of Intelligent Manufacturing · doi:10.1007/bf01471749 · Cited by 3
Slicing knowledge-based systems: techniques and applications
Vasconcelos, W. W., & Aragão, M. A. T. (2000) · Knowledge-Based Systems · doi:10.1016/s0950-7051(00)00058-7 · Cited by 3
An interpreter for large knowledge bases
Nussbaum, M. (1989) · doi:10.1145/75427.75436 · Cited by 3
Modeling advanced manufacturing systems using concurrent logic programming
Ben‐Arieh, D., & Miron, I. (1990) · Artificial Intelligence in Engineering · doi:10.1016/0954-1810(90)90034-2 · Cited by 3
Evaluation of declarative n-queens recursion: A deductive database approach
Han, J., Liu, L., & Lü, T. (1998) · Information Sciences · doi:10.1016/s0020-0255(97)10019-6 · Cited by 3
On function languages and parallel computers
Omondi, A. R. (1991) · Future Generation Computer Systems · doi:10.1016/0167-739x(91)90005-i · Cited by 3
A constraint-based approach for qualitative matrix structural analysis
Schwartz, D. I., & Chen, S. S. (1995) · Artificial intelligence for engineering design analysis and manufacturing · doi:10.1017/s0890060400002067 · Cited by 3
Nondeterminism and unification in LogScheme: integrating logic and functional programming
Ruf, E., & Weise, D. (1989) · doi:10.1145/99370.99400 · Cited by 3
Evaluation of regular nonlinear recursions by deductive database techniques
Han, J., & Lakshmanan, L. V. S. (1995) · Information Systems · doi:10.1016/0306-4379(95)00022-v · Cited by 3
On Delphi lemmas and other memoing techniques for deterministic logic programs
Tarau, P., Bosschere, K. D., & Demoen, B. (1997) · The Journal of Logic Programming · doi:10.1016/s0743-1066(96)00105-7 · Cited by 3
Design of a knowledge-based generic control protocol generator for automatic assembly operations
Kimbler, D. L., & Malavé, C. O. (1989) · International Journal of Computer Integrated Manufacturing · doi:10.1080/09511928908944378 · Cited by 3
Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism
Verbaeten, S., & Schreye, D. D. (2001) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s002000100066 · Cited by 3
A systematic approach to intelligent system design—II. Multi-level case study
Kim, S. H., & Tokawa, T. (1989) · Robotics and Computer-Integrated Manufacturing · doi:10.1016/0736-5845(89)90101-4 · Cited by 3
PROLOG and software engineering
Hogger, C. J. (1987) · Microprocessors and Microsystems · doi:10.1016/0141-9331(87)90475-3 · Cited by 3
Efficient interpretation of Prolog programs
Barklund, J. (1987) · ACM SIGPLAN Notices · doi:10.1145/960114.29664 · Cited by 3
FOAL 2003 Proceedings Foundations of Aspect-Oriented Langauges Workshop at AOSD 2003
Leavens, G. T., & Clifton, C. C. (2003) · Iowa State University Digital Repository (Iowa State University) · Cited by 3
Garbage Collection Algorithms for Java-Based Prolog Engines
Zhou, Q., & Tarau, P. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36388-2_21 · 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
Time in a multi-theory logical framework
Mancarella, P. M., Raffaetà, A., & Turini, F. (2002) · doi:10.1109/time.1997.600783 · Cited by 3
Semantic Inspection of Software Artifacts From Theory to Practice
Heyer, T. (2001) · DiVA (Linkoping University) · Cited by 3
Combining an improvement to PARMA trailing with trailing analysis
Schrijvers, T., & Demoen, B. (2002) · ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/571157.571167 · Cited by 3
Chain-split evaluation in deductive databases
Han, J. (2003) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1992.213172 · Cited by 3
Preliminary estimates of parallelism in CONSUL programs
Baldwin, D. (2003) · Proceedings of the ... Annual Hawaii International Conference on System Sciences/Proceedings of the Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.1989.48086 · Cited by 3
A methodology for proving termination of general logic programs
Marchiori, E. (1995) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 3
Barták, R., & Štěpánek, P. (1997) · Czech digital mathematics library · Cited by 3
Schrijvers, T., Serebrenik, A., & Demoen, B. (2003) · Lirias (KU Leuven) · Cited by 3
Approaches to grid-based SAT solving
Hyvärinen, A. E. J. (2009) · Aaltodoc (Aalto University) · Cited by 3
Distributing And- and Or-Work in the Andorra-I Parallel Logic Programming System
Dutra, I. (1995) · Cited by 3
Deville, Y., & Hentenryck, P. V. (1992) · Springer eBooks · doi:10.1007/978-94-011-2562-8_5 · Cited by 3
AMORE — Object Oriented Extensions to Prolog for the RUBRIC Implementation Environment
Palaskas, Z., Loucopoulos, P., & Assche, F. V. (1989) · Springer eBooks · doi:10.1007/978-94-009-1063-8_36 · Cited by 3
Programming Paradigms as Object Classes: A Structuring Mechanism for Multiparadigm Programming
Spinellis, D. D. (2002) · Cited by 3
Smith, M. P. (1988) · ACM SIGART Bulletin · doi:10.1145/44019.1058036 · Cited by 3
On Completeness of Logic Programs
Drabent, W. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-17822-6_15 · Cited by 2
Calculating modules in contextual logic program refinement
Colvin, R. J., Hayes, I. J., & Strooper, P. A. (2007) · Theory and Practice of Logic Programming · doi:10.1017/s1471068407003043 · Cited by 2
A Multi-Theory Logic Programming Language for the World Wide Web
Piancastelli, G., & Omicini, A. (2008) · AMS Acta (University of Bologna) · doi:10.6092/unibo/amsacta/2515 · Cited by 2
Takahashi, H., & Yoshie, O. (2005) · Lecture notes in computer science · doi:10.1007/11415763_19 · Cited by 2
Parameterizing a Groundness Analysis of Logic Programs
Lu, L. (2001) · Lecture notes in computer science · doi:10.1007/3-540-47764-0_9 · Cited by 2
Ariadne's thread: An introduction to logic programming
Midoro, V., Chioccariello, A., Persico, D., et al. (1988) · Computers & Education · doi:10.1016/0360-1315(88)90077-2 · Cited by 2
A Non-Chronological Backtracking Unfolding Algorithm for Transactional Web Service Composition
Blanco, E., Cardinale, Y., & Vidal, M.-E. (2012) · Procedia Computer Science · doi:10.1016/j.procs.2012.06.117 · Cited by 2
A logic programming approach to revealed preference theory
Lin, K.-P., & Perry, S. (1988) · Computational Economics · doi:10.1007/bf00427158 · Cited by 2
Optimization schemas for parallel implementation of non‐deterministic languages and systems
Gupta, G., & Pontelli, E. (2001) · Software Practice and Experience · doi:10.1002/spe.405 · Cited by 2
Database integration for knowledge based groundwater quality assessment
Armstrong, M. P. (1990) · Computers Environment and Urban Systems · doi:10.1016/0198-9715(90)90008-h · Cited by 2
Intelligent management of network devices aided by a strategy and a tool
Bianchini, C. P. (2003) · doi:10.1145/1035662.1035675 · Cited by 2
Definite-clause grammars for 2D shape analysis
Bribiesca, E., Rosenblueth, D. A., & Garza-Jinich, M. (1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)00141-k · Cited by 2
Secure Prolog-based mobile code
Loke, S. W., & Davison, A. J. (2001) · Theory and Practice of Logic Programming · doi:10.1017/s1471068401001211 · Cited by 2
JPC: A library for categorising and applying inter-language conversions between Java and Prolog
Castro, S., Mens, K., & Moura, P. (2015) · Science of Computer Programming · doi:10.1016/j.scico.2015.11.008 · Cited by 2
Category Theoretic Semantics for Theorem Proving in Logic Programming: Embracing the Laxness
Komendantskaya, E., & Power, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-40370-0_7 · Cited by 2
Proving completeness of logic programs with the cut
Drabent, W. (2016) · Formal Aspects of Computing · doi:10.1007/s00165-016-0392-0 · Cited by 2
Techniques for Searching, Parsing, and Matching
Pettorossi, A. (2021) · Springer eBooks · doi:10.1007/978-3-030-63189-5 · Cited by 2
Hmida, H. B., Cruz, C., Boochs, F., et al. (2012) · International Conference on Knowledge Engineering and Ontology Development · doi:10.5220/0004135702080213 · Cited by 2
The spirals of the Slope Chain Code
Bribiesca, E. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.06.016 · Cited by 2
Drabent, W. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-98869-2_4 · Cited by 2
Using logic programming for theory representation and scientific inference
Rohner, J.-C., & Kjellerstrand, H. (2020) · New Ideas in Psychology · doi:10.1016/j.newideapsych.2020.100838 · Cited by 2
Ryan, S. W., & Bansal, A. K. (1999) · Cited by 2
A Heuristic Approach to the Cable Routing Problem in Electrical Panels
Erwin, I. A., César, D. S., & Sasse, F. D. (2009) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-58603-936-3-55 · Cited by 2
Reality AI: a focus-on-knowledge methodology
López, A. M., Harris, S. H., Moses, H.-J., et al. (2007) · Journal of computing sciences in colleges · Cited by 2
Transformation Rules for Logic Programs with Goals as Arguments
Pettorossi, A., & Proietti, M. (2000) · Lecture notes in computer science · doi:10.1007/10720327_11 · Cited by 2
Applying Logic Programming to Derive Novel Functional Information of Genomes
Bansal, A. K., & Peer Bork, B. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49201-1_19 · Cited by 2
Masyagin, S., Nurgalieva, M., & Succi, G. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-29852-4_1 · Cited by 2
Methods for an Expert System to Access an External Database
Ernst, G. W., & Xiao-ping, H. (1993) · Intelligent Systems · doi:10.1007/978-1-4615-2836-4_3 · Cited by 2
Meta-Programming for Knowledge Base Systems
Lloyd, J. W. (1989) · Informatik-Fachberichte · doi:10.1007/978-3-642-75182-0_2 · Cited by 2
Vérification formelle de la plate-forme Java Card
Dufay, G. (2003) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3
Anwendung einer logischen Grammatik zur Generierung deutscher Texte
Jablonski, K., Rau, A., & Ritzke, J. (1988) · Informatik-Fachberichte · doi:10.1007/978-3-642-73998-9_10 · Cited by 2
Automatic implementation generation for pervasive applications
Paluska, J. M. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2
Compiling GOAL Agent Programs into Jazzyk Behavioural State Machines
Hindriks, K. V., & Novák, P. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87805-6_9 · Cited by 2
A generic declarative diagnoser for normal logic programs
Lu, L. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58216-9_45 · Cited by 2
Definition of external schemas and derived classes in object oriented databases
Jiménez, J. S. (1997) · doi:10.5821/dissertation-2117-93944 · Cited by 2
Multiparadigm Programming with Object-Oriented Languages
Davis, K., Smaragdakis, Y., & Striegnitz, J. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36208-8_13 · Cited by 2
“However, due to the requirement that this behaviour be specified in a declarative fashion mechanisms such as composition filters [ 1 ] and meta-object protocols [5] cannot be employed.”
BackgroundApplying Explanation-Based Learning to Natural language Processing (2)
Samuelsson, C., & Rayner, M. (1989) · Cited by 2
Pierce, B. C., & Levin, M. Y. (2005) · Cited by 2
A rule-based approach to web-based application development
Tammet, T., Haav, H.-M., Kadarpik, V., et al. (2006) · doi:10.1109/dbis.2006.1678497 · Cited by 2
A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data
Rao, M. R. K. K. (2005) · Lecture notes in computer science · doi:10.1007/11564089_25 · 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
Logic and functional programming by retractions
Bellia, M. (1988) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/1988220302711 · Cited by 2
Prolog: A step towards the future of programming
Štěpánková, O., & Štěpánek, P. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55681-8_30 · Cited by 2
Demand-driven Search in Functional Logic Programs
Hanus, M., & Réty, P. (2005) · Cited by 2
Eltantawi, M. R. A., & Maresca, P. (1996) · Engineering Applications of Artificial Intelligence · doi:10.1016/0952-1976(96)00050-4 · Cited by 2
The maintenance of intermediate values in goal-directed evaluation
Walker, K., & Griswold, R. E. (1992) · ACM Letters on Programming Languages and Systems · doi:10.1145/151640.151341 · Cited by 2
Syntactic Unification as a Geometric Operation in Free Modules over certain Rings
Banerjee, R. N., & Bujosa, A. (2002) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)80512-7 · Cited by 2
Bonsignori, A., Giannotti, F., Lucchesi, L., et al. (1990) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(90)90114-y · Cited by 2
A language for updating logic programs and its implementation
Leone, N., Palopoli, L., & Romeo, M. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)00025-2 · Cited by 2
On the use of advanced logic programming languages in computational linguistics
Coupet-Grimal, S., & Ridoux, O. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00040-q · Cited by 2
Recursive parser optimization by rewriting context-free grammars
Giannone, A., Eltantawi, M. R. A., & Maresca, P. (1997) · Engineering Applications of Artificial Intelligence · doi:10.1016/s0952-1976(97)00043-2 · Cited by 2
LCD-reification: a formal method for developing Prolog programs
Lin, F., & Hunt, F. E. (1989) · doi:10.1145/75199.75237 · Cited by 2
Teaching, learning and using Prolog: supporting the programmer
Brna, P., Pain, H., & du Boulay, B. (1991) · Instructional Science · doi:10.1007/bf00120877 · Cited by 2
A survey of PARLOG and Concurrent Prolog: The integration of logic and parallelism
Talia, D. (1993) · Computer Languages · doi:10.1016/0096-0551(93)90024-u · Cited by 2
Recursive query processing using graph traversal techniques
Pulido, E. (1996) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/238355.238371 · Cited by 2
Semantics of well-moded input-consuming logic programs
Bossi, A., Etalle, S., & Rossi, S. (2000) · Computer Languages · doi:10.1016/s0096-0551(01)00005-4 · Cited by 2
Representing knowledge with theories about theories
Stabler, E. P. (1990) · The Journal of Logic Programming · doi:10.1016/0743-1066(90)90035-4 · Cited by 2
The representation of rules in the ER model
Monarchi, D. E., & Smith, J. R. (1992) · Data & Knowledge Engineering · doi:10.1016/0169-023x(92)90017-6 · Cited by 2
Giannone, A., & Maresca, P. (1995) · Engineering Applications of Artificial Intelligence · doi:10.1016/0952-1976(95)00006-m · Cited by 2
Integration of knowledge-based systems with data processing
Nomura, T., & Lunn, S. (1987) · Knowledge-Based Systems · doi:10.1016/0950-7051(87)90004-9 · Cited by 2
A database of groups of prime‐power order
Butler, G., Iyer, S. S., & O’Brien, E. A. (1994) · Software Practice and Experience · doi:10.1002/spe.4380241004 · Cited by 2
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
