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 401–500 of 1,000
SCOOP Structured Concurrent Object Oriented Prolog
Vaucher, J. G., Lapalme, G., & Malenfant, J. (1988) · Lecture notes in computer science · doi:10.1007/3-540-45910-3_12 · Cited by 11
Techniques for implementing contexts in Logic Programming
Denti, E., Lamma, E., Mello, P., et al. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56454-3_17 · Cited by 11
On the mechanics of metasystem hierarchies in program transformation
Glück, R. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60939-3_18 · Cited by 11
Design and implementation of practical constraint logic programming systems
Michaylov, S. (1992) · Defense Technical Information Center (DTIC) · Cited by 11
Static analysis of a parallel logic language based on the blackboard model
Castagnetti, T., & Ciancarini, P. (1991) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(91)90100-n · Cited by 11
Programming in logic with constraints for natural language processing
Saint‐Dizier, P. (1989) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.3115/976815.976827 · Cited by 11
Finding Hypotheses from Examples by Computing the Least Generalization of Bottom Clauses
Ito, K., & Yamamoto, A. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49292-5_27 · Cited by 11
Ellman, T., & Murata, T. (1998) · Automated Software Engineering · doi:10.1023/a:1008604724481 · Cited by 11
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings
Serebrenik, A., & Schreye, D. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45142-0_5 · Cited by 11
A closer look at declarative interpretations
Apt, K. R., Gabbrielli, M., & Pedreschi, D. (1996) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00150-6 · Cited by 11
Logic programming and cardinality constraints : theory and practice
Syrjänen, T. (2009) · Aaltodoc (Aalto University) · Cited by 11
Efficient Detection of Incompleteness Errors in the Abstract Debugging of Logic Programs.
Comini, M., Levi, G., & Vitiello, G. (1995) · Cited by 11
LogicCrowd: A Declarative Programming Platform for Mobile Crowdsourcing
Phuttharak, J., & Loke, S. W. (2013) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2013.158 · Cited by 10
Towards B as a High-Level Constraint Modelling Language
Leuschel, M., & Schneider, D. C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43652-3_8 · Cited by 10
Inferring Relations Among Test Programs in Microservices Applications
Angelis, E. D., Angelis, G. D., Pellegrini, A., et al. (2021) · IEEE International Conference on Service-Oriented System Engineering (SOSE) · doi:10.1109/sose52839.2021.00018 · Cited by 10
Design and Implementation of the ROL Deductive Object-Oriented Database System
Liu, M. (2000) · Journal of Intelligent Information Systems · doi:10.1023/a:1008774006482 · Cited by 10
A bit-mapped classifier for groundwater quality assessment
Armstrong, M. P., & Bennett, D. A. (1990) · Computers & Geosciences · doi:10.1016/0098-3004(90)90005-e · Cited by 10
Propositional Logic Constraint Patterns and Their Use in UML-Based Conceptual Modeling and Analysis
Davis, J. P., & Bonnell, R. D. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.45 · Cited by 10
Is Default Logic a Reinvention of Inductive-Statistical Reasoning?
Tan, Y. (1997) · Synthese · doi:10.1023/a:1004999920152 · Cited by 10
A pragmatic reconstruction of λProlog
Belleannée, C., Brisset, P., & Ridoux, O. (1999) · The Journal of Logic Programming · doi:10.1016/s0743-1066(98)10038-9 · Cited by 11
Towards more Realistic Logic-based Robot Controllers in the GOLOG Framework.
Großkreutz, H., & Lakemeyer, G. (2000) · Cited by 10
Inference of Termination Conditions for Numerical Loops in Prolog
Serebrenik, A., & Schreye, D. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45653-8_45 · Cited by 10
Managing Ontological Constraints
Kalfoglou, Y., & Robertson, D. (1999) · ePrints Soton (University of Southampton) · Cited by 10
Pontelli, E., Le, H. V., & Son, T. C. (2009) · Computer Languages · doi:10.1016/j.cl.2009.09.001 · Cited by 10
Specifying goal-oriented network management systems
Bean, A., Wood, D., & Fairclough, W. F. (1993) · IEEE Communications Magazine · doi:10.1109/35.212419 · Cited by 10
Evolution of rule-based programs
Lämmel, R. (2004) · The Journal of Logic and Algebraic Programming · doi:10.1016/j.jlap.2004.03.006 · Cited by 10
A prolog toolkit for formal languages and automata
Michel Wermelinger, B., & Dias, A. M. (2005) · Annual Conference on Innovation and Technology in Computer Science Education (ITiCSE) · doi:10.1145/1067445.1067536 · Cited by 10
Inference of termination conditions for numerical loops in Prolog
Serebrenik, A., & Schreye, D. D. (2004) · Theory and Practice of Logic Programming · doi:10.1017/s1471068404002042 · Cited by 12
McCarthy, J., & Amir, E. (2001) · Cited by 10
The Design of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages
da Silva, A. F., & Costa, V. S. (2020) · doi:10.3217/jucs-012-07-0764 · Cited by 10
Transformation-Oriented Programming: A Development Methodology for High Assurance Software
Winter, V., Roach, S., & Wickstrom, G. (2003) · Advances in computers · doi:10.1016/s0065-2458(03)58002-0 · Cited by 10
Refinement strategies for inductive learning of simple prolog programs
Kirschenbaum, M., & STERLING, L. S. (1991) · Cited by 10
Self-citationSchreye, D., & Martens, B. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-56282-6_13 · Cited by 10
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
Bossi, A., Etalle, S., Rossi, S., et al. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_27 · Cited by 10
KDL-advisor: a knowledge/data based system written in KDL
Potter, W. 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.1988.11923 · Cited by 10
Scrimshaw: A language for document queries and transformations
Arnon, D. S. (1993) · Cited by 10
Abstract Interpretation, Bug Detection and Bug Diagnosis in Normal Logic Programs
Lu, L. (1994) · Cited by 10
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
Wang, Q., Gupta, G., & Leuschel, M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30557-6_9 · Cited by 9
Moseley, B., & Marks, P. J. (2006) · Cited by 9
Modeling Higher-Order Network Adaptation by Multilevel Network Reification
Jan Treur, A. (2019) · Studies in systems, decision and control · doi:10.1007/978-3-030-31445-3_4 · Cited by 9
Systemy ekspertowe we wspomaganiu procesów zarządzania wiedzą w organizacji
Michalik, K. (2014) · Prace Naukowe / Uniwersytet Ekonomiczny w Katowicach · Cited by 9
Using Extended Logic Programming for Alarm-Correlation in Cellular Phone Networks
Damásio, C. V., Fröhlich, P., Nejdl, W., et al. (2002) · Applied Intelligence · doi:10.1023/a:1016112931442 · Cited by 9
Analogical logic program synthesis from examples
Sadohara, K., & Haraguchi, M. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59286-5_61 · Cited by 9
Using Extended Logic Programming for Alarm-Correlation in Cellular Phone Networks
Fröhlich, P., Nejdl, W., Schroeder, M., et al. (1999) · Lecture notes in computer science · doi:10.1007/978-3-540-48765-4_38 · Cited by 9
Efficient Negation Using Abstract Interpretation
Muñoz, S., Moreno, J. J., & Hermenegildo, M. V. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45653-8_33 · Cited by 9
Practical Methods for Proving Termination of General Logic Programs
Marchiori, E. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.198 · Cited by 9
Compile-time memory reuse in logic programming languages through update in place
Gudjónsson, G., & Winsborough, W. H. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319309 · Cited by 9
Niemi, T., & Järvelin, K. (1992) · Information Systems · doi:10.1016/0306-4379(92)90006-9 · Cited by 9
Towards a methodology for the design of abstract machines for logic programming languages
Nilsson, U. (1993) · The Journal of Logic Programming · doi:10.1016/0743-1066(93)90026-d · Cited by 9
Approaches for Learning Prolog Programming
Yang, S., & Joy, M. S. (2007) · Innovation in Teaching and Learning in Information and Computer Sciences · doi:10.11120/ital.2007.06040088 · Cited by 9
Stone, M. (2002) · doi:10.3115/1118108.1118119 · Cited by 9
An interactive source commenter for Prolog programs
Roach, D., Berghel, H., & Talburt, J. R. (1990) · doi:10.1145/97426.98002 · Cited by 9
The Complexity of Model Checking in Modal Event Calculi with Quantifiers
Iliano Cervesato, A., Franceschet, M., & Montanari, A. (2018) · doi:10.1184/r1/6610454 · Cited by 9
Bossi, A., & Cocco, N. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49674-2_2 · Cited by 8
“2) Let us consider a few programs taken from [18].”
BackgroundOn hereditary Harrop formulae as a basis for logic programming
Harland, J. (1991) · Edinburgh Research Archive (University of Edinburgh) · Cited by 9
External Schema Generation Algorithms for Object Oriented Databases
Samos, J., & Saltor, F. (1997) · Springer eBooks · doi:10.1007/978-1-4471-0973-0_22 · Cited by 9
Gao, X., & STERLING, L. S. (1998) · Swinburne figshare (Swinburne University of Technology) · doi:10.25916/sut.26272102 · Cited by 9
Self-citationSynthesis of Programs from Unfold/Fold Proofs
Proietti, M., & Pettorossi, A. (1994) · Workshops in computing · doi:10.1007/978-1-4471-3234-9_13 · Cited by 9
A case study in applying Ontologies to augment and reason about the correctness of Specifications
Kalfoglou, Y., & Robertson, D. (1999) · ePrints Soton (University of Southampton) · Cited by 9
A refinement calculus for tuple spaces
Semini, L., & Montangero, C. (1999) · Science of Computer Programming · doi:10.1016/s0167-6423(98)00021-5 · Cited by 9
“…hA;#i; s j=w hB;#i 9s1 s2 : s1 ] s2 s; s1 j=w hA;#i; s2 j=w hB;#i In other words, p((cid:22)x) holds in a state s with substitution # if and only if s contains the (ground) atom p((cid:22)x)#, for p 2 Pred, or the (ground) atom p((cid:22)x)# is true in the usual Prolog semantics [52] if p 2 Test.”
BackgroundAttribute-grammar interpreter for inexact reasoning
Panayiotopoulos, T., Papakonstantinou, G., & Sgouros, N. M. (1990) · Information and Software Technology · doi:10.1016/0950-5849(90)90004-b · Cited by 9
Madnick, S., & Zhu, H. (2005) · Cited by 9
Zin, N. A. M., Abdullah, S. N. H. S., Zainal, N. F. A., et al. (2012) · International Journal on Advanced Science Engineering and Information Technology · doi:10.18517/ijaseit.2.6.244 · Cited by 8
The List Introduction Strategy for the Derivation of Logic Programs
Pettorossi, A., & Proietti, M. (2002) · Formal Aspects of Computing · doi:10.1007/s001650200011 · Cited by 8
Haberman, B., & Scherz, Z. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31958-0_18 · Cited by 8
Fuzzy Unification and Argumentation for Well-Founded Semantics
Schweimeier, R., & Schroeder, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24618-3_9 · Cited by 8
Consensus ex Machina? Consensus qua Machina!
Meister, J. C. (1995) · Literary and Linguistic Computing · doi:10.1093/llc/10.4.263 · Cited by 8
A flexible parser for a Linguistic Development Environment
Erbach, G. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54594-8_53 · Cited by 8
Generalization in Hierarchies of Online Program Specialization Systems
Glück, R., John Hatcliff, A., & Jørgensen, J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48958-4_10 · Cited by 8
Detecting Determinacy in Prolog Programs
King, A., Lu, L., & Genaim, S. (2006) · Lecture notes in computer science · doi:10.1007/11799573_12 · Cited by 8
A New Technique for Verifying and Correcting Logic Programs
Caferra, R., & Peltier, N. (1997) · Journal of Automated Reasoning · doi:10.1023/a:1005878609884 · Cited by 8
“’ This program is very well explained in [43] and belongs to the folklore of logic programming.”
InfluentialSemantics-Based Filtering: Logic Programming’s Killer App
Gupta, G., Guo, H.-F., Karshmer, A. I., et al. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45587-6_7 · Cited by 8
Introduction to cognitive musicology
Laske, O. (1989) · Journal of Musicological Research · doi:10.1080/01411898908574606 · Cited by 8
Lee, S.-J., & Wu, C. (1994) · Journal of Automated Reasoning · doi:10.1007/bf00885766 · Cited by 8
Rapidly prototyping implementation infrastructure of domain specific languages
Wang, Q., & Gupta, G. (2005) · ACM Symposium on Applied Computing · doi:10.1145/1066677.1066998 · Cited by 8
Designing an urban-scale auditory alert system
Avanzini, F., Rocchesso, D., Belussi, A., et al. (2004) · Computer · doi:10.1109/mc.2004.129 · Cited by 8
Logic Programming and Constraint Logic Programming
Cohen, J. (1996) · ACM Computing Surveys · doi:10.1145/234313.234416 · Cited by 8
Decidability of logic program semantics and applications to testing
Ruggieri, S. (2000) · The Journal of Logic Programming · doi:10.1016/s0743-1066(99)00067-9 · Cited by 8
Computer-aided software engineering of expert systems
Lirov, Y. (1991) · Expert Systems with Applications · doi:10.1016/0957-4174(91)90039-h · Cited by 8
A language-driven approach for the design of interactive applications
Sierra, J. L., Fernández‐Manjón, B., & Fernández‐Valmayor, A. (2007) · Interacting with Computers · doi:10.1016/j.intcom.2007.09.001 · Cited by 8
Using Constraint Logic Programming to Analyze theChronology in ``A Rose for Emily''
Burg, J. J., Boyle, A., & Lang, S.-D. (2000) · Computers and the Humanities · doi:10.1023/a:1026594916008 · Cited by 8
Semantics-basedWeb Service Composition engine
Kona, S., Bansal, A., Gupta, G., et al. (2007) · doi:10.1109/cec-eee.2007.87 · Cited by 8
The application of prolog to structured design
Tse, T. H., Chen, T. Y., Chan, F.-T., et al. (1994) · Software Practice and Experience · doi:10.1002/spe.4380240705 · Cited by 8
Predicate Answer Set Programming with Coinduction
Gupta, G., & Min, R. (2010) · Cited by 8
Fakultät, P. (1991) · Cited by 8
Termination Analysis of Logic Programs
Serebrenik, A. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24599-5_45 · Cited by 8
“87 can be illustrated by the following analysis of the famous game program (Apt and Pedreschi, 1993; Apt and Pedreschi, 1991; Sterling and Shapiro, 1994).”
BackgroundMethodInfluentialCompilation-based list processing in deductive databases
Han, J. (2005) · Springer eBooks · doi:10.1007/bfb0032426 · Cited by 8
Refining specifications to logic programs
Hayes, I. J., Nickson, R., & Strooper, P. A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62718-9_1 · Cited by 8
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs
Janhunen, T. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44957-4_57 · Cited by 8
Spreadsheet Structure Discovery with Logic ProgrammingPreprint
Paine, J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0802.3940 · Cited by 8
An abstract interpretation scheme for identifying inherent parallelism in logic programs
Bansal, A. K., & STERLING, L. S. (1990) · New Generation Computing · doi:10.1007/bf03037209 · Cited by 8
Self-citationDIALOG — A dataflow model for parallel execution of logic programs
Kang Zhang, A., & Thomas, R. (1991) · Future Generation Computer Systems · doi:10.1016/0167-739x(91)90006-j · Cited by 8
Direct automated inversion of logic grammars
Minnen, G., Gerdemann, D., & Hinrichs, E. (1996) · New Generation Computing · doi:10.1007/bf03037497 · Cited by 8
Russo, M. F., & Peskin, R. L. (1992) · Journal of Automated Reasoning · doi:10.1007/bf02341856 · Cited by 8
Transaction specification in multidatabase systems based on parallel logic programming
Kuehn, E. M., Puntigam, F., & Elmagarmid, A. K. (2002) · doi:10.1109/ims.1991.153693 · Cited by 8
Termination of simply moded logic programs with dynamic scheduling
Bossi, A., Etalle, S., Rossi, S., et al. (2004) · ACM Transactions on Computational Logic · doi:10.1145/1013560.1013564 · Cited by 8
Verifying termination and error-freedom of logic programs with block declarations
Smaus, J., Hill, P. M., & King, A. (2001) · Theory and Practice of Logic Programming · doi:10.1017/s1471068401001107 · Cited by 8
Komendantskaya, E., Johann, P., & Schmidt, M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.07865 · Cited by 8
A new method for integrity constraint checking in deductive databases
Seljée, R. (1995) · Data & Knowledge Engineering · doi:10.1016/0169-023x(94)00032-a · Cited by 14
2D tree object representation via the slope chain code
Bribiesca, E., & Bribiesca‐Contreras, G. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2014.04.010 · Cited by 7
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
