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 201–300 of 1,000
Efficient implementation of narrowing and rewriting
Hanus, M. (2005) · Springer eBooks · doi:10.1007/bfb0013543 · Cited by 29
Querying UML Models using OCL and Prolog: A Performance Study
Chimiak–Opoka, J., Felderer, M., Lenz, C., et al. (2008) · doi:10.1109/icstw.2008.33 · Cited by 28
A framework for computer-assisted travel counseling
Loban, S. R. (1997) · Annals of Tourism Research · doi:10.1016/s0160-7383(97)00027-3 · Cited by 28
Brna, P., Bundy, A., Dodd, T., et al. (1991) · Instructional Science · doi:10.1007/bf00120879 · Cited by 28
An Approach for Recovering Distributed System Architectures
Mendonça, N. C., & Kramer, J. (2001) · Automated Software Engineering · doi:10.1023/a:1011217720860 · Cited by 28
CLARE: A Contextual Reasoning and Cooperative Response Framework for the Core Language EnginePreprint
Alshawi, H., Carter, D. M., Crouch, R., Pulman, S., Rayner, M., & Smith, A. G. (1994) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9411002 · Cited by 28
Techniques for the formal definition of the G-LOTOS syntax
Bolognesi, T., & Latella, D. (2003) · IEEE Workshop on Visual Languages (VL) · doi:10.1109/wvl.1989.77040 · Cited by 28
OPEN ONTOLOGY-BASED INTEGRATION PLATFORM FOR MODELING AND SIMULATION IN ENGINEERING
Karhela, T. A., Villberg, A., & Niemistö, H. (2012) · Advances in Complex Systems · doi:10.1142/s1793962312500043 · Cited by 27
Multi-chromosomal genetic programming
Cavill, R., Smith, S., & Tyrrell, A. M. (2005) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1068009.1068300 · Cited by 27
DLAB: A declarative language bias formalism
Dehaspe, L., & Raedt, L. D. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61286-6_185 · Cited by 27
Proving properties of logic programs by abstract diagnosis
Comini, M., Levi, G., Meo, M. C., et al. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62503-8_2 · Cited by 27
The denotational semantics of a functional tree-manipulation language
Malton, A. J. (1993) · Computer Languages · doi:10.1016/0096-0551(93)90031-u · Cited by 27
A Prolog Benchmark Suite for Aquarius
Haygood, R. (1989) · doi:10.21236/ada211444 · Cited by 27
Specialising Interpreters Using Offline Partial Deduction
Leuschel, M., Craig, S.-J., Bruynooghe, M., & Vanhoof, W. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25951-0_11 · Cited by 26
A domain specific language framework for non-visual browsing of complex HTML structures
Pontelli, E., Xiong, W., Gupta, G., & Karshmer, A. I. (2000) · International ACM SIGACCESS Conference on Computers and Accessibility (ASSETS) · doi:10.1145/354324.354373 · Cited by 26
An Incremental Deductive Strategy for Controlling Constructive Induction in Learning from Examples
Elio, R., & Watanabe, L. (1991) · Machine Learning · doi:10.1007/bf00058925 · Cited by 26
Experimental evaluation of a generic abstract interpretation algorithm for Prolog
Charlier, B. L., & Hentenryck, P. V. (2003) · International Conference on Computer Languages (ICCL) · doi:10.1109/iccl.1992.185476 · Cited by 26
SQUALL: The expressiveness of SPARQL 1.1 made available as a controlled natural language
Ferré, S. (2014) · Data & Knowledge Engineering · doi:10.1016/j.datak.2014.07.010 · Cited by 25
A heuristic approach to modelling thinnings
Daume, S., & Robertson, D. (2000) · Silva Fennica · doi:10.14214/sf.628 · Cited by 25
Efficient translation of lazy functional logic programs into Prolog
Hanus, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60939-3_19 · Cited by 25
On the soundness and safety of expert systems
Fox, J. (1993) · Artificial Intelligence in Medicine · doi:10.1016/0933-3657(93)90015-u · Cited by 25
Preference Logic Grammars: Fixed point semantics and application to data standardization
Cui, B., & Swift, T. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00185-6 · Cited by 25
“, [16]), such that atoms of the form prefer/2 do not occur in the bodies of clauses in P or Pref .”
BackgroundDebugging in applicative languages
O’Donnell, J. T., & Hall, C. V. (1988) · LISP and Symbolic Computation · doi:10.1007/bf01806168 · Cited by 25
Brayshaw, M., & Eisf, M. (1991) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(05)80180-4 · Cited by 25
Logic Based Methods for Terminological Assessment
Robichaud, B. (2012) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/5pfvmss38ob7 · Cited by 24
Model-Checking In-Lined Reference Monitors
Sridhar, M., & Hamlen, K. W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11319-2_23 · Cited by 24
Helma, C., Krämer, S., Pfahringer, B., et al. (2000) · Environmental Health Perspectives · doi:10.1289/ehp.001081029 · Cited by 24
A Functional-Logic Perspective of Parsing
Caballero, R., & López-Fraguas, F. J. (1999) · Lecture notes in computer science · doi:10.1007/10705424_6 · Cited by 24
Knowledge-based adaptive computer control in manufacturing systems: a case study
Lingarkar, R., Liu, L., Elbestawi, M. A., et al. (1990) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.57273 · Cited by 24
Explaining evidential analyses
Strat, T. M., & Lowrance, J. D. (1989) · International Journal of Approximate Reasoning · doi:10.1016/0888-613x(89)90020-0 · Cited by 24
On the complexity of or-parallelism
Ranjan, D., Pontelli, E., & Gupta, G. (1999) · New Generation Computing · doi:10.1007/bf03037223 · Cited by 24
Languages for the specification of software
Cooke, D. E., Gates, A. Q., Demirors, E., et al. (1996) · Journal of Systems and Software · doi:10.1016/0164-1212(95)00071-2 · Cited by 24
Temporal Assertions with Parametrised Propositions
Stolz, V. (2007) · Springer eBooks · doi:10.1007/978-3-540-77395-5_15 · Cited by 23
Reading and writing mathematics
Karshmer, A. I., Gupta, G., Geiiger, S., & Weaver, C. (1998) · International ACM SIGACCESS Conference on Computers and Accessibility (ASSETS) · doi:10.1145/274497.274524 · Cited by 23
Logical diagnosis ofLDL programs
Shmueli, O., & Tsur⋆, S. (1991) · New Generation Computing · doi:10.1007/bf03037166 · Cited by 23
Gupta, G., & Akhter, S. F. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46584-7_21 · Cited by 23
Leuschel, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-47018-2_5 · Cited by 23
XML Goes Native: Run-Time Representations for Xtatic
Gapeyev, V., Levin, M. Y., Pierce, B. C., et al. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31985-6_4 · Cited by 23
Denotational semantics of a goal-directed language
Gudeman, D. (1992) · ACM Transactions on Programming Languages and Systems · doi:10.1145/111186.104659 · Cited by 23
Lucas, P. (1995) · The Knowledge Engineering Review · doi:10.1017/s0269888900008134 · Cited by 23
Directional types and the annotation method
Boye, J., & Małuszyński, J. (1997) · The Journal of Logic Programming · doi:10.1016/s0743-1066(96)00144-6 · Cited by 23
Tecnologia adaptativa em engenharia de computação: estado da arte e aplicações.
Pistori, H. (2003) · doi:10.11606/t.3.2003.tde-02032004-145107 · Cited by 23
Loke, S. W. (2011) · Future Generation Computer Systems · doi:10.1016/j.future.2011.09.004 · Cited by 22
Key to Artificial Intelligence (AI)
Heiden, B., & Tonino-Heiden, B. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-55190-2_49 · Cited by 22
Effective compilation of constraint models
Rendl, A. (2010) · Cited by 22
A Logic Framework for C2C Network Management
Balzano, W., Sorbo, M. R. D., & Stranieri, S. (2016) · International Conference on Advanced Information Networking and Applications Workshops (WAINA) · doi:10.1109/waina.2016.138 · Cited by 22
Declarative Diagnosis Revisited
Comini, M., Levi, G., & Vitiello, G. (1995) · The MIT Press eBooks · doi:10.7551/mitpress/4301.003.0032 · Cited by 22
An adaptive knowledge-acquisition system using generic genetic programming
Wong, M. L. (1998) · Expert Systems with Applications · doi:10.1016/s0957-4174(98)00010-4 · Cited by 22
Classes of terminating logic programs
Pedreschi, D., Ruggieri, S., & Smaus, J. (2002) · Theory and Practice of Logic Programming · doi:10.1017/s1471068402001400 · Cited by 22
Object-oriented information management
Lockemann, P. C. (1989) · Decision Support Systems · doi:10.1016/0167-9236(89)90030-4 · Cited by 22
Nonmonotonic Inductive Logic Programming
Sakama, C. (2001) · Cited by 21
The use of prolog for improving the rigour and accessibility of ecological modelling
Muetzelfeldt, R. I., Robertson, D., Bundy, A., et al. (1989) · Ecological Modelling · doi:10.1016/0304-3800(89)90067-7 · Cited by 21
Deductive Synthesis of Recursive Plans in Linear Logic
Cresswell, S., Smaill, A., & Richardson, J. (2000) · Lecture notes in computer science · doi:10.1007/10720246_20 · Cited by 21
“However, a plan-forming routine can be written to interpret declared operators and queries in the style of a meta-interpreter [18], while building up the extracted plan, and allowing an induction rule to be used.”
BackgroundA workbench for program comprehension during software maintenance
Canfora, G., Mancini, L., & Tortorella, M. (2002) · doi:10.1109/wpc.1996.501118 · Cited by 21
Verification of logic programs
Pedreschi, D., & Ruggieri, S. (1999) · The Journal of Logic Programming · doi:10.1016/s0743-1066(98)10035-3 · Cited by 21
Learning from Entailment of Logic Programs with Local Variables
Rao, M. R. K. K., & Sattar, A. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49730-7_11 · Cited by 21
Abductive Equivalential Translation and its application to Natural Language Database InterfacingPreprint
Rayner, M. (1994) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9405024 · Cited by 21
CDAO-Store: Ontology-driven Data Integration for Phylogenetic Analysis
Chisham, B., Wright, B., Le, T. H., et al. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-98 · Cited by 20
Precedences in specifications and implementations of programming languages
Aasa, A. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(95)90680-j · Cited by 20
SuperGlue: Component Programming with Object-Oriented Signals
McDirmid, S., & Hsieh, W. C.-Y. (2006) · Lecture notes in computer science · doi:10.1007/11785477_15 · Cited by 20
Symbiotic Reflection between an Object-Oriented and a Logic Programming Language
Wuyts, R., & Ducasse, S. (n.d.) · BORIS (University Library Bern) · doi:10.7892/boris.104812 · Cited by 20
Logic programming in artificial intelligence
Kowalski, R. (1991) · International Joint Conference on Artificial Intelligence · Cited by 20
The XSB System Version 2.5 Volume 1: Programmer's Manual
Sagonas, K., Swift, T., Warren, D. S., et al. (2003) · DSpace - NTUA (National Technical University of Athens) · Cited by 20
Castillo, O., & Melín, P. (2002) · doi:10.1109/cifer.1995.495269 · Cited by 20
Negation in logic programming: A formalization in constructive logic
Bry, F. (1991) · Lecture notes in computer science · doi:10.1007/3-540-53557-8_20 · Cited by 20
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
Komendantskaya, E., Guy Mccusker, B., & Power, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-17796-5_7 · Cited by 19
Lee, R. M., & Ryu, Y. U. (1995) · Journal of Management Information Systems · doi:10.1080/07421222.1995.11518073 · Cited by 19
Hermenegildo, M. V. (2000) · Parallel Computing · doi:10.1016/s0167-8191(00)00051-x · Cited by 19
A model of the ‘redescription’ process in the context of geometric proportional analogy problems
O'Hara, S. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56004-1_19 · Cited by 19
Recognition of generic components using logic-program relations of image contours
Munck-Fairwood, R. (1991) · Image and Vision Computing · doi:10.1016/0262-8856(91)90021-g · Cited by 19
Improving explanations in knowledge-based systems: RATIONALE
Abu-Hakima, S., & Oppacher, F. (1990) · Knowledge Acquisition · doi:10.1016/s1042-8143(05)80012-3 · Cited by 19
Polymorphic type analysis in logic programs by abstract interpretation
Lu, L. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(97)10010-3 · Cited by 19
How to control unfolding when specializing interpreters
Lakhotia, A., & Sterling, L. (1990) · New Generation Computing · doi:10.1007/bf03037513 · Cited by 19
Self-citationProlog-based meta-rules for relational database representation and manipulation
Niemi, T., & Järvelin, K. (1991) · IEEE Transactions on Software Engineering · doi:10.1109/32.83913 · Cited by 19
RSF: a formalism for executable requirement specifications
Degl'Innocenti, M., Ferrari, G.-L., Pacini, G., et al. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.60312 · Cited by 19
Grid based propositional satisfiability solving
Hyvärinen, A. E. J. (2011) · Aaltodoc (Aalto University) · Cited by 19
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Saeedloei, N., & Gupta, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13089-2_45 · Cited by 18
Using Grammarware Languages to Define Operational Semantics of Modelled Languages
Sadilek, D. A., & Wachsmuth, G. H. (2009) · Lecture notes in business information processing · doi:10.1007/978-3-642-02571-6_20 · Cited by 18
Mathematical programming: Turing completeness and applications to software analysis
Liberti, L., & Marinelli, F. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9715-3 · Cited by 18
“Declarative programming languages, such as MP, Prolog (Shapiro 1997) or Constraint Programming (CP) (Apt 2003), do not prescribe sequences of instructions, but rather define computable functions via a set of conditions, or constraints: for example, a simple linear program P(c1, c2)might ask for a vector (x1, x2)maximi…”
BackgroundHeat exchanger network retrofit via constraint logic programming
Abbas, H., Wiggins, G., Lakshmanan, R., et al. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(99)80033-7 · Cited by 18
Consistency checking of binary categorical relationships in a medical knowledge base
Moser, W., & Adlassnig, K.-P. (1992) · Artificial Intelligence in Medicine · doi:10.1016/0933-3657(92)90022-h · Cited by 18
Why the occur-check is not a problem
Apt, K. R., & Pellegrini, A. (2006) · Springer eBooks · doi:10.1007/3-540-55844-6_128 · Cited by 18
Declarative programming in Prolog
Apt, K. R. (1993) · Data Archiving and Networked Services (DANS) · Cited by 18
Composing recursive logic programs withClausal join
Lakhotia, A., & STERLING, L. S. (1988) · New Generation Computing · doi:10.1007/bf03037138 · Cited by 18
Self-citationWhy untyped nonground metaprogramming is not (much of) a problem
Martens, B., & de Schreye, D. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)00015-x · Cited by 23
Aborting, suspending, and resuming goals and plans in BDI agents
Harland, J., Morley, D. N., Thangarajah, J., et al. (2015) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-015-9322-4 · Cited by 17
Combining Semantics with Non-standard Interpreter Hierarchies
Abramov, S., & Glück, R. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44450-5_16 · Cited by 17
Semi-inversion of Guarded Equations
Mogensen, T. Æ. (2005) · Lecture notes in computer science · doi:10.1007/11561347_14 · Cited by 17
Robust spoken language understanding in a computer game
Boye, J., Gustafson, J., & Wirén, M. (2005) · Speech Communication · doi:10.1016/j.specom.2005.06.015 · Cited by 17
Improving information system development and evolution using a rule-based paradigm
Loucopoulos, P., & Layzell, P. J. (1989) · Software Engineering Journal · doi:10.1049/sej.1989.0036 · Cited by 17
Handbook for Language Engineers
Farghaly, A. (2003) · Cited by 17
Logic, Programming and Prolog (2ed)
Nilsson, U., & Małuszyński, J. (1995) · Cited by 17
Programming by Numbers: A Programming Method for Novices
Glaser, H. (2000) · The Computer Journal · doi:10.1093/comjnl/43.4.252 · Cited by 17
Sosič, R. (1994) · ACM SIGARCH Computer Architecture News · doi:10.1145/192537.192541 · Cited by 17
Semantics directed program execution monitoring
Kishon, A., & Hudak, P. (1995) · Journal of Functional Programming · doi:10.1017/s0956796800001465 · Cited by 17
Semiotes: a semantics for sharing
Kazic, T. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.12.1129 · Cited by 17
Sison, R. C., Numao, M., & Shimura, M. (1998) · User Modeling and User-Adapted Interaction · doi:10.1023/a:1008225015395 · Cited by 17
“, using an ‘accumulator’ variable (Sterling and Shapiro, 1986).”
Abstract debugging of logic programs
Comini, M., Levi, G., & Vitiello, G. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58792-6_27 · Cited by 17
Placer, J. (1991) · Computer Languages · doi:10.1016/0096-0551(91)90009-x · Cited by 17
Logical reasoning in natural language: It is all about knowledge
Iwańska, L. (1993) · Minds and Machines · doi:10.1007/bf00974107 · Cited by 16
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
