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 101–200 of 1,000
A constraint-based approach for specification and verification of real-time systems
Gupta, G., & Pontelli, E. (2002) · Proceedings/Proceedings - Real-Time Systems Symposium · doi:10.1109/real.1997.641285 · Cited by 63
Pfenning, F. (2020) · Cited by 63
Metric Methods Three Examples and a Theorem
Fitting, M. (1994) · The Journal of Logic Programming · doi:10.1016/s0743-1066(14)80007-1 · Cited by 61
Retrieval from hierarchical texts by partial patterns
Kilpeläinen, P., & Mannila, H. (1993) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/160688.160722 · Cited by 61
Inductive Logic Programming as Abductive Search
Corapi, D., Russo, A., & Lupu, E. (2010) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.iclp.2010.54 · Cited by 60
An Arabic morphological system
El-Sadany, T. A., & Hashish, M. A. (1989) · IBM Systems Journal · doi:10.1147/sj.284.0600 · Cited by 60
Reflection principles in computational logic
Barklund, J. (2000) · Journal of Logic and Computation · doi:10.1093/logcom/10.6.743 · Cited by 60
Operational versus definitional: a perspective on programming paradigms
Ambler, A. L., Burnett, M., & Zimmerman, B. A. (1992) · Computer · doi:10.1109/2.156380 · Cited by 59
Opium: an extendable trace analyzer for Prolog
Ducassé, M. (1999) · The Journal of Logic Programming · doi:10.1016/s0743-1066(98)10036-5 · Cited by 59
Requirements and information structures for building product data models
Björk, B. (1995) · Aaltodoc (Aalto University) · Cited by 59
Context representation and reasoning in pervasive computing: a review
Perttunen, M., Riekki, J. P., & Lassila, O. (2011) · Cited by 58
How to calculate symmetries of Petri nets
Schmidt, K. (2000) · Acta Informatica · doi:10.1007/s002360050002 · Cited by 58
Integrating induction and deduction for finding evidence of discrimination
Pedreschi, D., Ruggieri, S., & Turini, F. (2009) · Proceedings of the 12th International Conference on Artificial Intelligence and Law · doi:10.1145/1568234.1568252 · Cited by 55
A theoretical framework on proactive information exchange in agent teamwork
Fan, X., Yen, J., & Volz, R. A. (2005) · Artificial Intelligence · doi:10.1016/j.artint.2005.06.005 · Cited by 56
Efficient bottom-up computation of queries on stratified databases
Balbin, I., Port, G. S., Ramamohanarao, K., et al. (1991) · The Journal of Logic Programming · doi:10.1016/0743-1066(91)90030-s · Cited by 56
A fundamental and theoretical framework for an intelligent CAD system
Akman, V., ten Hagen, P. J. W., & Tomiyama, T. (1990) · Computer-Aided Design · doi:10.1016/0010-4485(90)90086-r · Cited by 56
Verification of Erlang programs using abstract interpretation and model checking
Huch, F. (1999) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/317636.317908 · Cited by 55
Cholewiński, P., Marek, V. W., Truszczyński, M., & Mikitiuk, A. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00053-3 · Cited by 55
Optimising Bytecode Emulation for Prolog
Costa, V. S. (1999) · Lecture notes in computer science · doi:10.1007/10704567_16 · Cited by 53
“Byte-code representation [14,9,20] has been used to implement several programming languages including Lisp [25], ML [17], Prolog [24], and Java [2].”
On applying or-parallelism and tabling to logic programs
Rocha, R., Silva, F., & Costa, V. S. (2005) · Theory and Practice of Logic Programming · doi:10.1017/s1471068404002030 · Cited by 52
Cartographic name placement with Prolog
Jones, C. B. (1989) · IEEE Computer Graphics and Applications · doi:10.1109/38.35536 · Cited by 52
Principles of Inverse Computation and the Universal Resolving Algorithm
Abramov, S., & Glück, R. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36377-7_13 · Cited by 51
On the occur-check-free PROLOG programs
Apt, K. R., & Pellegrini, A. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/177492.177673 · Cited by 50
Costantini, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45632-5_11 · Cited by 49
“The reader may refer to [51] for an illustration of the meta-interpreter programming techniques and of their applications, including the specification of Expert Systems in Prolog.”
BackgroundMethodOn the insufficiency of ontologies: problems in knowledge sharing and alternative solutions
da Silva, F. S. C., Vasconcelos, W. W., Robertson, D. S., et al. (2002) · Knowledge-Based Systems · doi:10.1016/s0950-7051(01)00152-6 · Cited by 49
Acquiring qualitative knowledge about complex agroecosystems. Part 2: Formal representation
Walker, D. H., & Sinclair, F. (1998) · Agricultural Systems · doi:10.1016/s0308-521x(97)00049-8 · Cited by 49
(2003) · Bloomsbury Publishing Plc eBooks · doi:10.1007/978-1-349-91518-7 · Cited by 48
Proof methods of declarative properties of definite programs
Deransart, P. (1993) · Theoretical Computer Science · doi:10.1016/0304-3975(93)90107-5 · Cited by 48
A reverse engineering method for identifying reusable abstract data types
Canfora, G., Cimitile, A., & Munro, M. (2002) · Proceedings - Working Conference on Reverse Engineering · doi:10.1109/wcre.1993.287777 · Cited by 48
Nadathur, G., & Miller, D. (1988) · ScholarlyCommons (University of Pennsylvania) · Cited by 47
Soundness and completeness of non-classical extended SLD-resolution
Vojtáš, P., & Paulík, L. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60983-0_20 · Cited by 47
Evolutionary Program Induction Directed by Logic Grammars
Wong, M. L., & Leung, K. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.2.143 · Cited by 45
“In this paper, logic grammars are described in a notation similar to that of definite clause grammars (Pereira and Warren, 1980; Pereira and Shieber, 1987; Sterling and Shapiro 1986).”
On the unification free prolog programs
Apt, K. R., & Etalle, S. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57182-5_1 · Cited by 47
Hentenryck, P. V., Cortesi, A., & Charlier, B. L. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)00029-6 · Cited by 45
An introduction to executable temporal logics
Fisher, M. (1996) · Knowledge engineering review (Print) · doi:10.1017/s0269888900007670 · Cited by 52
An Automatic Partial Evaluator for Full Prolog
Sahlin, D. (1991) · Cited by 44
Some low-level source transformations of logic programs
Gallagher, J. P., & Bruynooghe, M. (1990) · Lirias · Cited by 44
A UNITY-style programming logic for shared dataspace programs
Cunningham, H. C., & Roman, G.-C. (1990) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.80163 · Cited by 44
TermiLog: A system for checking termination of queries to logic programs
Lindenstrauss, N., Sagiv, Y., & Serebrenik, A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63166-6_44 · Cited by 43
Offline specialisation in Prolog using a hand-written compiler generator
Leuschel, M., Jørgensen, J., Vanhoof, W., & Bruynooghe, M. (2004) · Theory and Practice of Logic Programming · doi:10.1017/s1471068403001662 · Cited by 46
An interleaving model for real-time systems
Chen, L. (2005) · Springer eBooks · doi:10.1007/bfb0023865 · Cited by 43
Computer Aided Transformation of Z into Prolog
Dick, A. J. J., Krause, P. J., & Cozens, J. (1990) · Workshops in computing · doi:10.1007/978-1-4471-3877-8_5 · Cited by 43
Logic modeling: A tool for management science
Kimbrough, S. O., & Lee, R. M. (1988) · Decision Support Systems · doi:10.1016/0167-9236(88)90094-2 · Cited by 42
Integrating induction and deduction for finding evidence of discrimination
Ruggieri, S., Pedreschi, D., & Turini, F. (2010) · Artificial Intelligence and Law · doi:10.1007/s10506-010-9089-5 · Cited by 41
Multistrategy Discovery and Detection of Novice Programmer Errors
Sison, R. C., Numao, M., & Shimura, M. (2000) · Machine Learning · doi:10.1023/a:1007690108308 · Cited by 41
Initial Implementation of a Comparative Data Analysis Ontology
Prosdocimi, F., Chisham, B., Pontelli, E., Thompson, J., & Stoltzfus, A. (2009) · Evolutionary Bioinformatics · doi:10.4137/ebo.s2320 · Cited by 39
An expert system for the evaluation of EDSS in multiple sclerosis
Gáspari, M., Gianluigi, R., Scandellari, C., et al. (2002) · Artificial Intelligence in Medicine · doi:10.1016/s0933-3657(02)00015-5 · Cited by 40
Declarative Aspect-Oriented Programming.
Lämmel, R. (1999) · Cited by 40
Declarative diagnosis of missing answers
Naish, L. (1992) · New Generation Computing · doi:10.1007/bf03037939 · Cited by 40
Logic programming environments: Dynamic program analysis and debugging
Ducassé, M., & Noyé, J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90030-2 · Cited by 40
Checking Existing Requirements for Compliance with Law Using a Production Rule Model
Maxwell, J. C., & Antón, A. I. (2009) · International Workshop on Requirements Engineering and Law · doi:10.1109/relaw.2009.3 · Cited by 40
Horn Logic Denotations and Their Applications
Gupta, G. (1999) · Artificial intelligence · doi:10.1007/978-3-642-60085-2_6 · Cited by 39
Cortesi, A., Charlier, B. L., & Hentenryck, P. V. (2000) · Science of Computer Programming · doi:10.1016/s0167-6423(99)00045-3 · Cited by 39
Automatic construction of accurate models of physical systems
Bradley, E., & Stolle, R. (1996) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf02284622 · Cited by 39
“Since this prototype of the program emphasizes correctness over e ciency, the uni cation algorithm includes the occurs check[50].”
BackgroundAı̈t-Kaci, H. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54141-1_4 · Cited by 39
Access Control Policies and Languages in Open Environments
di Vimercati, S. D. C., Foresti, S., Jajodia, S., & Samarati, P. (2007) · Advances in information security · doi:10.1007/978-0-387-27696-0_2 · Cited by 38
Maxwell, J. C., & Antón, A. I. (2010) · doi:10.1145/1882992.1883092 · Cited by 37
On the meta-logic of arguments
Wooldridge, M., McBurney, P., & Parsons, S. (2005) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/1082473.1082558 · Cited by 37
“First, it we believe it would be straightforward to implement such a hierarchical argument system: in particular, prolog has been found to be an extremely useful tool for meta-logical reasoning and the implementation of meta-interpreters for logics [ 21 ].”
MethodDisjunctive Logic Programming: A Survey and Assessment
Minker, J., & Seipel, D. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45628-7_18 · Cited by 37
A path finding method for constraint checking in deductive databases
Das, S. K., & Williams, M. H. (1989) · Data & Knowledge Engineering · doi:10.1016/0169-023x(89)90021-9 · Cited by 37
The integration of functions into logic programming: a survey
Hanus, M. (1994) · Cited by 37
Implementing incremental view maintenance in nested data models
Kawaguchi, A., Lieuwen, D. F., Mumick, I. S., et al. (1998) · Lecture notes in computer science · doi:10.1007/3-540-64823-2_12 · Cited by 36
Norm Verification and Analysis of Electronic Institutions
Vasconcelos, W. W. (2005) · Lecture notes in computer science · doi:10.1007/11493402_10 · Cited by 36
“Clearly, the removal of parts of an e-institution is a dicult and error-prone task and designers need support to perform it. We propose the use of metaprogramming [13, 14 ] to help designers analyse and manipulate e-institutions with a view to extracting sub-portions of it in which certain properties hold.”
BackgroundFast Prolog with an extended general purpose architecture
Holmer, B. K., Sano, B., Carlton, M., et al. (1990) · ACM SIGARCH Computer Architecture News · doi:10.1145/325096.325154 · Cited by 36
Viana, A. C., Maag, S., & Zaïdi, F. (2011) · ACM Computing Surveys · doi:10.1145/1883612.1883614 · Cited by 34
The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV
Schellhorn, G., & Ahrendt, W. (1998) · Applied logic series · doi:10.1007/978-94-017-0437-3_7 · Cited by 35
Kernels on Prolog Proof Trees:Statistical Learning in the ILP Setting
Passerini, A., Frasconi, P., & Raedt, L. D. (2006) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dagsemproc.05051.8 · Cited by 36
Interpreting Bayesian Logic Programs
Kersting, K., Raedt, L. D., & Krämer, S. (2000) · Cited by 35
Advanced Techniques for Logic Program Specialisation
Leuschel, M. (1997) · Lirias · Cited by 35
On the completeness of object-creating database transformation languages
den Bussche, J. V., Dirk Van Gucht, Z., Andries, M., et al. (1997) · Journal of the ACM · doi:10.1145/256303.256311 · Cited by 34
An Overview of Formal Methods Tools and Techniques
Almeida, J. B., Frade, M. J., Pinto, J. S., et al. (2011) · Undergraduate topics in computer science · doi:10.1007/978-0-85729-018-2_2 · Cited by 33
Timetabling in constraint logic programming
Kambi, M., & Gilbert, D. (1996) · Brunel University Research Archive (BURA) (Brunel University London) · Cited by 33
Problem decomposition and the learning of skills
Michie, D. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59286-5_46 · Cited by 33
A prolog technology theorem prover: A new exposition and implementation in Prolog
Stickel, M. E. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52531-9_135 · Cited by 33
Nondeterministic control structures for graph rewriting systems
Zündorf, A., & Schürr, A. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55121-2_5 · Cited by 33
DeGroot, D. (1988) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(88)90010-x · Cited by 33
Automatic debugging of Prolog programs in a Prolog Intelligent Tutoring System
Looi, C. (1991) · Instructional Science · doi:10.1007/bf00120883 · Cited by 32
Keijzer, M., Babovic, V., Ryan, C., O’Neill, M., & Cattolico, M. (2001) · Cited by 32
Hickey, T. J., & Mudambi, S. (1989) · The Journal of Logic Programming · doi:10.1016/0743-1066(89)90021-6 · Cited by 32
A declarative debugger for Haskell
Pope, B. J. (2006) · Minerva Access (University of Melbourne) · Cited by 32
Coalgebraic logic programming: from Semantics to Implementation
Komendantskaya, E., Power, J., & Schmidt, M. H. (2014) · Journal of Logic and Computation · doi:10.1093/logcom/exu026 · Cited by 31
Extending logic programming with coinduction
Gupta, G., & Simon, L. (2006) · Cited by 31
Automating the detection of reusable parts in existing software
Dunn, M. F., & Knight, J. C. (1993) · doi:10.5555/257572.257660 · Cited by 31
Hybrid Probabilistic Logic Programs as Residuated Logic Programs
Damásio, C. V., & Pereira, L. M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40006-0_5 · Cited by 31
Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs
Caballero, R., López-Fraguas, F. J., & Rodríguez-Artalejo, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44716-4_11 · Cited by 31
Modeling the Rational Basis of Musical Expression
Widmer, G. (1995) · Computer Music Journal · doi:10.2307/3680601 · Cited by 31
An Efficient Abstract Machine for Curry
Lux, W., & Kuchen, H. (1999) · Informatik aktuell · doi:10.1007/978-3-662-01069-3_58 · Cited by 31
VIP-MDBS: a logic multidatabase system
Kühn, E., & Ludwig, T. G. (1988) · International Symposium on Databases for Parallel and Distributed Systems · doi:10.5555/62597.62618 · Cited by 31
The generation of explanations within evidential reasoning systems
Strat, T. M. (1987) · International Joint Conference on Artificial Intelligence · Cited by 30
Bousi~Prolog: a Prolog Extension Language for Flexible Query Answering
Julián-Iranzo, P., Rubio-Manzano, C., & Gallardo-Casero, J. (2009) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2009.07.064 · Cited by 30
“Weak SLD resolution is implemented by means of a meta-interpreter [ 19 ].”
Back to the Future: Pointcuts as Predicates over Traces
Klose, K., & Ostermann, K. (2005) · Cited by 30
A comparative revisitation of some program transformation techniques
Pettorossi, A., & Proietti, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_18 · Cited by 30
Lightweight languages as software engineering tools
Spinellis, D. D., & Guruprasad, V. (1997) · Cited by 30
Coordinating rule-based software processes with ESP
Ciancarini, P. (1993) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/152388.152393 · Cited by 30
“The theory interface follows the keyword eval and it includes a number of rules (also called “patterns”), separated by the symbol # ; the theory implementation is the Prolog program that follows the keyword with (the reader not familiar with Prolog will find a good introduction to it and its terminology in [37]).”
Creating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(97)10012-7 · Cited by 29
Understanding programming languages
Ben-Ari, M. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 29
Proving existential termination of normal logic programs
Massimo Marchiori, B. (1996) · Lecture notes in computer science · doi:10.1007/bfb0014328 · Cited by 29
Combining Norms to Prove Termination
Genaim, S., Codish, M., Gallagher, J. P., et al. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47813-2_9 · Cited by 29
Conklin, D., & Witten, I. H. (1994) · Machine Learning · doi:10.1007/bf00993307 · Cited by 29
Karshmer, A. I., Gupta, G., Pontelli, E., et al. (2003) · International ACM SIGACCESS Conference on Computers and Accessibility (ASSETS) · doi:10.1145/1028630.1028642 · Cited by 29
“However, the problem of translating Nemeth Math to LaTeX was regarded as unsolvable until Gupta, Karshmer, and Guo developed a semantics-based approach to solve this problem based on logic programming [ 16 ].”
Influential
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
