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 301–400 of 1,000
The cube lattice model and its applications
Chaudron, L., Maille, N., & Boyer, M. (2003) · Applied Artificial Intelligence · doi:10.1080/713827121 · Cited by 16
Meta-circular Abstract Interpretation in Prolog
Codish, M., & Søndergaard, H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36377-7_6 · Cited by 16
Logic Programming as a Paradigm for Financial Modeling1
Minch, R. P. (1989) · MIS Quarterly · doi:10.2307/248702 · Cited by 16
Advanced topics in automated deduction
Bibel, W. (1988) · Lecture notes in computer science · doi:10.1007/3-540-50676-4_9 · Cited by 16
Indirect relevance and bias in inductive concept-learning
Raedt, L. D., & Bruynooghe, M. (1990) · Knowledge Acquisition · doi:10.1016/s1042-8143(05)80014-7 · Cited by 16
Parallel programming with logic languages: A survey
Ciancarini, P. (1992) · Computer Languages · doi:10.1016/0096-0551(92)90013-d · Cited by 16
Branching-time logic programming: the language Cactus and its applications
Rondogiannis, P., Gergatsoulis, M., & Panayiotopoulos, T. (1998) · Computer Languages · doi:10.1016/s0096-0551(98)00009-5 · Cited by 16
Efficient reordering of Prolog programs
Gooley, M. M., & Wah, B. W.-S. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43422 · Cited by 16
A model for access negotiations in dynamic coalitions
Khurana, H., & Gligor, V. D. (2005) · IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE) · doi:10.1109/enabl.2004.4 · Cited by 16
Parametric order-sorted types in logic programming
Hanus, M. (1991) · Lecture notes in computer science · doi:10.1007/3540539816_67 · Cited by 16
A framework for CAD-based geometric reasoning for robot assembly language†
Nnaji, B. O. (1988) · International Journal of Production Research · doi:10.1080/00207548808947901 · Cited by 16
Logic Programming for Data Warehouse Conceptual Schema Validation
Dell’Aquila, C., Tria, F. D., Lefons, E., et al. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15105-7_1 · Cited by 15
Spatio-temporal Annotated Constraint Logic Programming
Raffaetà, A., & Frühwirth, T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45241-9_18 · Cited by 15
Correctness and Completeness of Logic Programs
Drabent, W. (2016) · ACM Transactions on Computational Logic · doi:10.1145/2898434 · Cited by 15
Explaining Prolog based expert systems using a layered meta-interpreter
STERLING, L. S., & Yalçinalp, L. Ü. (1989) · International Joint Conference on Artificial Intelligence · Cited by 15
Self-citationParma—bridging the performance gap between imperative and logic programming
Taylor, A. (1996) · The Journal of Logic Programming · doi:10.1016/s0743-1066(96)00065-9 · Cited by 15
A toolkit for the incremental implementation of heterogeneous database management systems
Drew, P., King, R., & Heimbigner, D. M. (1992) · The VLDB Journal · doi:10.1007/bf01231701 · Cited by 15
Towards intelligent services: a case study in chemical emergency response
Bansal, A., Patel, K., Gupta, G. K., et al. (2005) · IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws.2005.122 · Cited by 15
Towards a logic programming methodology based on higher-order predicates
Hamfelt, A., & Nilsson, J. F. (1997) · New Generation Computing · doi:10.1007/bf03037300 · Cited by 15
Extension table built‐ins for prolog
Fan, C., & Dietrich, S. W. (1992) · Software Practice and Experience · doi:10.1002/spe.4380220706 · Cited by 15
Towards automatical migration of transformation rules after grammar extension
Lohmann, W., & Riedewald, G. (2003) · Proceedings of the ... European Conference on Software Maintenance and Reengineering/Proceedings of the European Conference on Software Maintenance and Reengineering · doi:10.1109/csmr.2003.1192408 · Cited by 15
Amtoft, T. (1993) · DAIMI Report Series · doi:10.7146/dpb.v22i453.6771 · Cited by 15
Automated Generation of Itineraries in Recommender Systems for Tourism
Bitonto, P. D., Tria, F. D., Laterza, M., Roselli, T., Rossano, V., & Tangorra, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16985-4_48 · Cited by 15
Concurrent Prolog: A progress report
Shapiro, E. Y. (2005) · Springer eBooks · doi:10.1007/bfb0022685 · Cited by 15
Self-citationSpecialisation of a Unification Algorithm
de Waal, D. A., & Gallagher, J. P. (1992) · Workshops in computing · doi:10.1007/978-1-4471-3494-7_15 · Cited by 15
Use of Formal Ontologies to Support Error Checking in Specifications
Kalfoglou, Y., & Robertson, D. G. C. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48775-1_13 · Cited by 15
On modular termination proofs of general logic programs
Bossi, A., Cocco, N., Rossi, S., et al. (2002) · Theory and Practice of Logic Programming · doi:10.1017/s1471068402001382 · Cited by 15
Some classes of prolog programs inferable from positive data
Rao, M. R. K. K. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00271-6 · Cited by 15
Placer, J. (1991) · ACM SIGPLAN Notices · doi:10.1145/122167.122168 · Cited by 15
Enhancing coordination and modularity mechanisms for a language with objects-as-multisets
Castellani, S., & Ciancarini, P. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61052-9_41 · Cited by 15
Automatic generation of compiled forms for linear recursions
Han, J., & Zeng, K. (1992) · Information Systems · doi:10.1016/0306-4379(92)90020-n · Cited by 15
Prological Language Processing
Lämmel, R., & Riedewald, G. (2001) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)80924-1 · Cited by 15
Acceptability with General Orderings
Schreye, D. D., & Serebrenik, A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45628-7_9 · Cited by 17
Deductive Multi-valued Model Checking
Mallya, A. (2005) · Lecture notes in computer science · doi:10.1007/11562931_23 · Cited by 14
Dimensional fact model extension via predicate calculus
Dell’Aquila, C., Tria, F. D., Lefons, E., et al. (2009) · International Symposium on Computer and Information Sciences · doi:10.1109/iscis.2009.5291846 · Cited by 14
Tor : Modular search with hookable disjunction
Schrijvers, T., Demoen, B., Triska, M., et al. (2013) · Science of Computer Programming · doi:10.1016/j.scico.2013.05.008 · Cited by 14
Man bites dog: looking for interesting inconsistencies in structured news reports
Byrne, E., & Hunter, A. (2003) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(03)00123-x · Cited by 14
Towards a taxonomy of novices' misconceptions of the Prolog interpreter
Fung, P., Brayshaw, M., du Boulay, B., et al. (1990) · Instructional Science · doi:10.1007/bf00116443 · Cited by 14
Collaborative software infrastructure for adaptive multiple model simulation
Delalondre, F., Smith, C., & Shephard, M. S. (2010) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2010.01.011 · Cited by 14
An Active Rule-Based Approach for Constraint Management of Biological Data in XML Documents
Jones, D., Jin, Y., & Xu, H. (2007) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm.2007.29 · Cited by 14
“Moreover, constraints of the store can be defined using the computational machinery of Prolog [ 28 ,27].”
Chorale harmonization: A view from a search control perspective
Phon-Amnuaisuk, S., Smaill, A., & Wiggins, G. A. (2006) · Journal of New Music Research · doi:10.1080/09298210701458835 · Cited by 14
“The problem solving process is declaratively and procedurally expressed as a meta-interpreter (in the style of Sterling and Shapiro ( 1994 )) such that the domain theory D and control C (constructed from the language L O or L M ) together describe the search process.”
BackgroundVanhoof, W., & Martens, B. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49674-2_17 · Cited by 14
Tim: The toulouse inference machine for non-classical logic programming
Balbiani, P., Herzig, A., & Marques, M. L. (2005) · Springer eBooks · doi:10.1007/bfb0013544 · Cited by 14
A constraint approach to mastermind in logic programming
Hentenryck, P. V. (1988) · ACM SIGART Bulletin · doi:10.1145/44418.44421 · Cited by 14
A language for optimizing constraint propagation
Havens, W. S., & Sidebottom, G. (1993) · Cited by 14
Subset-Logic Programming: Application and Implementation.
Jayaraman, B., & Nair, A. (1988) · Cited by 14
Program Derivation via List Introduction
Pettorossi, A., & Proietti, M. (1997) · IFIP advances in information and communication technology · doi:10.1007/978-0-387-35264-0_12 · Cited by 14
Web Service Discovery and Composition using USDL
Kona, S., Bansal, A., Gupta, G., et al. (2006) · doi:10.1109/cec-eee.2006.95 · Cited by 13
Revising Process Models through Inductive Learning
Maggi, F. M., Corapi, D., Russo, A., Lupu, E., & Visaggio, G. (2011) · Lecture notes in business information processing · doi:10.1007/978-3-642-20511-8_16 · Cited by 13
An environment for supporting active learning in courses on language processing
Sierra, J. L., Fernández-Pampillón, A. M., & Fernández‐Valmayor, A. (2008) · Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE) · doi:10.1145/1384271.1384307 · Cited by 13
Language-based software engineering
Gupta, G. (2014) · Science of Computer Programming · doi:10.1016/j.scico.2014.02.010 · Cited by 13
Lazy narrowing with simplification
Hanus, M. (1997) · Computer Languages · doi:10.1016/s0096-0551(97)00010-6 · Cited by 13
A typed foundation for directional logic programming
Reddy, U. S. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56454-3_15 · Cited by 13
Antoy, S. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54444-5_113 · Cited by 13
Toward a quality assessment framework for knowledge-based systems
Preece, A. D. (1995) · Journal of Systems and Software · doi:10.1016/0164-1212(94)00106-w · Cited by 13
A useful extension to Prolog's definite clause grammar notation
Roy, P. V. (1989) · ACM SIGPLAN Notices · doi:10.1145/71605.71617 · Cited by 13
Blending imperative and relational programming
Budd, T. A. (1991) · IEEE Software · doi:10.1109/52.62933 · Cited by 13
Bansal, A. K., & Potter, J. L. (1992) · Engineering Applications of Artificial Intelligence · doi:10.1016/0952-1976(92)90008-8 · Cited by 13
Concurrency and backtracking in Vienna Parallel Logic
Kühn, E., Pohlai, H., & Puntigam, F. (1993) · Computer Languages · doi:10.1016/0096-0551(93)90033-w · Cited by 13
Barbuti, R., Codish, M., Giacobazzi, R., et al. (1995) · Information and Computation · doi:10.1006/inco.1995.1146 · Cited by 13
Ducassé, M., & Emde, A.-M. (1991) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/122538.122549 · Cited by 13
Toward constraint-object-oriented development
Bolognesi, T. (2000) · IEEE Transactions on Software Engineering · doi:10.1109/32.859530 · Cited by 12
ActionScript In-Lined Reference Monitoring in Prolog
Sridhar, M., & Hamlen, K. W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11503-5_13 · Cited by 12
FROM STANDARD TO NON-STANDARD SEMANTICS BY SEMANTICS MODIFIERS
Abramov, S., & Glück, R. (2001) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054101000448 · Cited by 13
A constraint logic programming approach to 3D structure determination of large protein complexes
Palù, A. D., Pontelli, E., He, J. J., et al. (2006) · ACM Symposium on Applied Computing · doi:10.1145/1141277.1141309 · Cited by 12
Logic programming based curriculum for high school students
Scherz, Z., & Haberman, B. (1995) · ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/199688.199848 · Cited by 12
Revision, Acceptability and Context
Gabbay, D. M., Rodrigues, O., & Russo, A. (2010) · Cognitive technologies · doi:10.1007/978-3-642-14159-1 · Cited by 12
Helping visually impaired students in the study of mathematics
Karshmer, A. I., Pontelli, E., & Gupta, G. (2003) · doi:10.1109/fie.1999.841638 · Cited by 12
Quantifying over Dynamic Properties of Program Execution
Bockisch, C. M., Mezini, M., & Ostermann, K. (2005) · TUbilio (Technical University of Darmstadt) · Cited by 12
Fourer, R. (1998) · Operations research, computer science. Interface series · doi:10.1007/978-1-4757-2807-1_2 · Cited by 12
“Descendants of Prolog [ 26 ] that handle objectives and constraints, including CHIP [28], ECLiPSe [8] and Prolog III [6].”
Tableau calculus for order sorted logic
Schmitt, P. H., & Wernecke, W. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52337-6_18 · Cited by 12
Combining logical agents with rapid prototyping for engineering distributed applications
Dart, P. W., Kazmierczak, E., STERLING, L. S., et al. (2003) · doi:10.1109/step.1999.798478 · Cited by 12
Self-citationExtracting information from free-text aircraft repair notes
Farley, B. (2001) · Artificial intelligence for engineering design analysis and manufacturing · doi:10.1017/s0890060401154041 · Cited by 12
Notes on implementing sets in Prolog
Munakata, T. (1992) · Communications of the ACM · doi:10.1145/131295.131300 · Cited by 12
Bisschop, J., & Fourer, R. (1996) · Computational Optimization and Applications · doi:10.1007/bf00248011 · Cited by 12
“In fact a logic programming language such as Prolog [ 44 ] is analogous, in several important respects, to an algebraic modeling language such as AMPL that has been extended to encompass decision sets.”
BackgroundModelling discrete optimisation problems inconstraint logic programming
Barth, P. M., & Bockmayr, A. (1998) · Annals of Operations Research · doi:10.1023/a:1018981813157 · Cited by 12
Knowledge-based assistant for colonscopy
Sucar, L. E., & Gillies, D. F. (1990) · International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE) · doi:10.1145/98894.98914 · Cited by 12
Problem solving by searching for models with a theorem prover
Lee, S.-J., & Plaisted, D. A. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90082-5 · Cited by 12
Learning recursive functions from noisy examples using generic genetic programming
Wong, M. L., & Leung, K. (1996) · Cited by 12
LIFE, a Natural Language for Natural Language
Aı̈t-Kaci, H., Lincoln, P. D., Nasr, R., et al. (2007) · Cited by 12
Reasoning about synchronic groups
Roman, G.-C., & Cunningham, H. C. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55160-3_31 · Cited by 12
Improving control of logic programs by using functional logic languages
Hanus, M. (2006) · Springer eBooks · doi:10.1007/3-540-55844-6_124 · Cited by 12
A fully abstract semantics for a first-order functional language with logic variables
Jagadeesan, R., Pingali, K. K., & Panangaden, P. (1991) · ACM Transactions on Programming Languages and Systems · doi:10.1145/115372.115371 · Cited by 12
Operation-oriented query language approach for recursive queries—part 1. Functional definition
Niemi, T., & Järvelin, K. (1992) · Information Systems · doi:10.1016/0306-4379(92)90005-8 · Cited by 12
The performance of parallel Prolog programs
Fagin, B. S., & Despain, A. M. (1990) · IEEE Transactions on Computers · doi:10.1109/12.61072 · Cited by 12
PENNY--a programming language and compiler for the context interchange project
Pena, F., Siegel, M. D., & Pena, F. (1997) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 12
Proceedings of the 13th International Workshop on Logic Programming Environments
Mesnard, F., & Serebrenik, A. (2003) · Lirias · Cited by 12
Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN
Leuschel, M., & Jørgensen, J. (2000) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)80636-x · Cited by 11
Reasoning about Solids Using Constraint Logic Programming
Pesant, G., & Boyer, M. (1999) · Journal of Automated Reasoning · doi:10.1023/a:1006080931326 · Cited by 11
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
Lindenstrauss, N., Sagiv, Y., & Serebrenik, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25951-0_14 · Cited by 11
“Finally (Table 4), we have collected a number of programs from different sources, including Prolog textbooks [1, 73] and research papers [2, 4, 77, 83, 82].”
BackgroundMethodServetto, M., & Zucca, E. (2010) · ACM International Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA) · doi:10.1145/1869459.1869498 · Cited by 11
O estudo linguistico-computacional da linguagem
da Silva, B. C. D. (2006) · Letras de Hoje · Cited by 11
Reusing formalisations of legislation in a tutoring system
Routen, T. (1992) · Artificial Intelligence Review · doi:10.1007/bf00150231 · Cited by 11
Non-Determinism and Lazy Evaluation in Logic Programming
Antoy, S. (1992) · Workshops in computing · doi:10.1007/978-1-4471-3494-7_23 · Cited by 11
Exploiting program schemata in a Prolog tutoring system
Gegg-Harrison, T. S. (1993) · Cited by 11
The implementation of generators and goal‐directed evaluation in icon
Wampler, S. B., & Griswold, R. E. (1983) · Software Practice and Experience · doi:10.1002/spe.4380130605 · Cited by 11
Tiling design patterns—a case study using the interpreter pattern
Lorenz, D. H. (1997) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/263698.263737 · Cited by 11
PDL-HM: morphological and syntactic shape classification algorithm
Arnarson, H., & Pau, L. F. (1994) · Machine Vision and Applications · doi:10.1007/bf01215802 · Cited by 11
Han, J., Liu, L., & Xie, Z. (1994) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/191246.191285 · Cited by 11
Hermenegildo, M. V. (1997) · Lecture notes in computer science · doi:10.1007/bfb0002715 · Cited by 11
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
