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 501–600 of 1,000
Temporal assertions for sequential and concurrent programs
Stolz, V. (2007) · Cited by 7
Cumulative Learning in the Lambda Calculus
Henderson, R. (2013) · doi:10.25560/24759 · Cited by 8
Profit: A system integrating logic programming and attribute grammars
Paakki, J. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54444-5_103 · Cited by 7
FleSe: A Tool for Posing Flexible and Expressive (Fuzzy) Queries to a Regular Database
Ceruelo, V. P., & Muñoz-Hernández, S. (2014) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-07593-8_20 · Cited by 7
Goschnick, S., & Graham, C. (2005) · Universal Access in the Information Society · doi:10.1007/s10209-005-0012-x · Cited by 7
Spatial reasoning about qualitative shape compositions
Falomir, Z., Pich, A., & Costa, V. (2019) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-019-09637-7 · Cited by 7
Teaching Programming Broadly and Deeply: The Kernel Language Approach
Roy, P. V., & Haridi, S. (2003) · IFIP advances in information and communication technology · doi:10.1007/978-0-387-35619-8_6 · Cited by 7
A Symbolic Representation for Patterns in Time Series Using Definitive Clause Grammars
Guimarães, G., & Ultsch, A. (1997) · Studies in classification, data analysis, and knowledge organization · doi:10.1007/978-3-642-59051-1_11 · Cited by 7
Give'on, Y. S. (1990) · Computers & Education · doi:10.1016/0360-1315(90)90020-8 · Cited by 7
Spill — A logic language for writing testable requirements specifications
Kluźniak, F., & Miłkowska, M. (1997) · Science of Computer Programming · doi:10.1016/s0167-6423(96)00021-4 · Cited by 7
Recursive ascent-descent parsing
Horspool, R. N. (1993) · Computer Languages · doi:10.1016/0096-0551(93)90027-x · Cited by 7
Knowledge based floor plan design by space partitioning: A logic programming approach
Kovács, L. B. (1991) · Artificial Intelligence in Engineering · doi:10.1016/0954-1810(91)90022-g · Cited by 7
Ringwood, G. A. (1989) · ACM SIGPLAN Notices · doi:10.1145/66068.66074 · Cited by 7
Forward and Backward Chaining in Linear Logic (Extended Abstract)
Harland, J., Pym, D. J., & Winikoff, M. (2000) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)01136-9 · Cited by 7
CLP and constraint abstraction
Hickey, T. J. (1989) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/75277.75288 · Cited by 7
Semantics of Agent Communication: An Introduction
van Eijk, R. M. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45634-1_10 · Cited by 7
West2East: exploiting WEb Service Technologies to Engineer Agent-based SofTware
Casella, G., & Mascardi, V. (2007) · International Journal of Agent-Oriented Software Engineering · doi:10.1504/ijaose.2007.016267 · Cited by 7
Interoperability between Bioinformatics Tools: A Logic Programming Approach
Iglesias, J. R., Gupta, G., Pontelli, E., et al. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45241-9_11 · Cited by 7
A Prolog Framework for the Rapid Prototyping of Language Processors with Attribute Grammars
Sierra, J. L., & Fernández‐Valmayor, A. (2006) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2006.10.002 · Cited by 7
Semantic Processing of the Semantic Web
Patel, K., & Gupta, G. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39718-2_6 · Cited by 7
“First, a parser can be obtained from the syntax specification with negligible effort: the BNF specification of a language L can be trivially translated to a Definite Clause Grammar (DCG) [ 35 ,31].”
Inference of termination conditions for numerical loopsPreprint
Serebrenik, A., & Schreye, D. D. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0106053 · Cited by 7
Concurrent inference through dual transformation
Bittencourt, G. (1998) · Logic Journal of IGPL · doi:10.1093/jigpal/6.6.795 · Cited by 7
Höök, K., Taylor, J., & du Boulay, B. (1990) · Instructional Science · doi:10.1007/bf00116444 · Cited by 7
Scheduling in or-parallel Prolog systems: Survey and open problems
Ciepielewski, A. (1991) · International Journal of Parallel Programming · doi:10.1007/bf01547894 · Cited by 7
Wise, M. J. (1993) · Software Practice and Experience · doi:10.1002/spe.4380230203 · Cited by 7
The strategic design driven inspection of machined parts
Galm, J. M., & Merat, F. L. (2003) · doi:10.1109/cim.1988.5401 · Cited by 7
Efficient reordering of Prolog programs
Gooley, M. M., & Wah, B. W.-S. (2003) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1988.105452 · Cited by 7
Modelo de desenvolvimento de arquitecturas de sistemas de informação
Tomé, P. (2004) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · Cited by 7
Introduction to Guarded Horn Clauses
Ueda, K. (1987) · Nec Research & Development · Cited by 7
A refined production rule model for aiding in regulatory compliance
Maxwell, J. C., & Antón, A. I. (2010) · NCSU Libraries Repository (North Carolina State University Libraries) · Cited by 7
Automatic Ordering of Subgoals - A Machine Learning Approach.
Markovitch, S., & Scott, P. D. (1989) · Cited by 7
Formal Verification and Visualization of Security Policies
Wahsheh, L. A., de Leon, D. C., & Alves-Foss, J. (2008) · Journal of Computers · doi:10.4304/jcp.3.6.22-31 · Cited by 6
Mondshein, L., Sattar, A., & Lorenzen, T. (2010) · ACM Inroads · doi:10.1145/1869746.1869761 · Cited by 6
A GOAL-DRIVEN NEURAL PROPOSITIONAL INTERPRETER
Lima, P. M. V. (2001) · International Journal of Neural Systems · doi:10.1016/s0129-0657(01)00076-x · Cited by 6
A pedagogic expert system shell in Prolog
Schneider, V. B. (1988) · ACM SIGPLAN Notices · doi:10.1145/44546.44548 · Cited by 6
Establishing a framework for comparative analysis of genome sequences
Bansal, A. K. (2002) · doi:10.1109/inbs.1995.404275 · Cited by 6
Coalgebraic Semantics for Logic Programming
Komendantskaya, E., Guy Mccusker, B., & Power, J. (2010) · Cited by 6
Automating Financial Regulatory Compliance Using Ontology+Rules and Sunflower
Ford, R., Denker, G., Elenius, D., et al. (2016) · International Conference on Semantic Systems · doi:10.1145/2993318.2993329 · Cited by 6
Extending Logic Programming with Labelled Variables: Model and Semantics
Calegari, R., Denti, E., Dovier, A., & Omicini, A. (2018) · Fundamenta Informaticae · doi:10.3233/fi-2018-1695 · Cited by 8
Verification of a Controller for Bart: An Approach Based on Horn Logic and Denotational Semantics
King, L., Gupta, G., & Pontelli, E. (2001) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4615-1391-9_11 · Cited by 6
An Assumption-based Truth Maintenance System in Active Aid for UNIX Users
JONES, J. D., Millington, M., & Virvou, M. K. (2000) · Artificial Intelligence Review · doi:10.1023/a:1006562430348 · Cited by 6
“The interested reader should consult (Stirling and Shapiro 1986).”
Using Context to Control Computer Vision Algorithms
Strat, T. M. (1995) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9242-1_1 · Cited by 6
Utility network derivation from legacy source data for feature-based AM/FM systems
Russomanno, D. J. (1998) · International Journal of Geographical Information Systems · doi:10.1080/136588198241743 · Cited by 6
Automatic model building and solving for optimization problems
Iijima, J. (1996) · Decision Support Systems · doi:10.1016/0167-9236(96)00030-9 · Cited by 6
Xie, H. (2000) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(2000)51:9 · Cited by 133
Direct manipulation of graph-based decision models
Lee, R. M. (1993) · Decision Support Systems · doi:10.1016/0167-9236(93)90049-9 · Cited by 6
Declarative Meta Programming to Support Software Development
Mens, T., Wuyts, R., Volder, K. D., et al. (2003) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/638750.638770 · Cited by 6
The Dharma scheduler-definitive scheduling in Aurora on multiprocessors architecture
Sindaha, R. Y. (2003) · IEEE Symposium on Parallel and Distributed Processing (SPDP) · doi:10.1109/spdp.1992.242731 · Cited by 6
Towards next generation logic programming systems
Gupta, G., & Bansal, A. (2007) · Cited by 6
Yet more efficient EM learning for parameterized logic programs by inter-goal sharing
Kameya, Y., Sato, T., & Zhou, N. (2004) · European Conference on Artificial Intelligence · Cited by 6
The functional logic language BABEL and its implementation on a graph machine
Kuchen, H., Loogen, R., Moreno-Navarro, J. J., et al. (1996) · New Generation Computing · doi:10.1007/bf03037211 · Cited by 6
The synchronic group: a concurrent programming concept and its proof logic
Roman, G.-C., & Cunningham, H. C. (2002) · International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1990.89278 · Cited by 6
Situation calculus specifications for event calculus logic programs
Miller, R. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59487-6_16 · Cited by 6
Set based failure diagnosis for concurrent constraint programming
Müller, M. L. (1998) · doi:10.22028/d291-25722 · Cited by 6
Memoing with Abstract Answers and Delphi Lemmas
Tarau, P., & Bosschere, K. D. (1994) · Workshops in computing · doi:10.1007/978-1-4471-3234-9_17 · Cited by 6
Automatic generation of provably correct parallelizing compilers
Gupta, G., Pontelli, E., Lara-Rodriguez, A., et al. (2002) · Proceedings of the International Conference on Parallel Processing · doi:10.1109/icpp.1998.708532 · Cited by 6
Proofs of declarative properties of logic programs
Deransart, P. (1989) · Lecture notes in computer science · doi:10.1007/3-540-50939-9_134 · Cited by 6
Using object oriented methods in Ada 95 to implement Linda
Lundqvist, K., & Wall, G. (1996) · Lecture notes in computer science · doi:10.1007/bfb0013490 · Cited by 6
A New approach for introducing Prolog to naive users
Maler, O., Scherz, Z., & Shapiro, E. Y. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_102 · Cited by 6
Self-citationA rapid turnaround design of a high speed VLSI search processor
Matoba, T., Lee, K. C., Herman, G., et al. (1991) · Integration · doi:10.1016/s0167-9260(05)80024-0 · Cited by 6
Teaching, learning and using Prolog: Understanding Prolog
Brna, P., Pain, H., & du Boulay, B. (1990) · Instructional Science · doi:10.1007/bf00116440 · Cited by 6
Meta-interpreters for rule-based inference under uncertainty
Schocken, S., & Finin, T. (1990) · Decision Support Systems · doi:10.1016/0167-9236(90)90006-d · Cited by 6
Towards the uniform implementation of declarative languages
Chakravarty, M. M. T., & Lock, H. C. R. (1997) · Computer Languages · doi:10.1016/s0096-0551(97)00012-x · Cited by 6
A logical approach to knowledge based control
Egilmez, K., & Kim, S. H. (1990) · Journal of Intelligent Manufacturing · doi:10.1007/bf01471342 · Cited by 6
Difference-list transformation for Prolog
Marriott, K., & Søndergaard, H. (1993) · New Generation Computing · doi:10.1007/bf03037156 · Cited by 6
Evaluation of functional linear recursions: A compilation approach
Han, J., & Wang, Q. (1991) · Information Systems · doi:10.1016/0306-4379(91)90034-7 · Cited by 6
Constraint-based query evaluation in deductive databases
Han, J. (1994) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.273030 · Cited by 6
Chong, C. N., Etalle, S., Hartel, P., et al. (2005) · International Conference on Enterprise Information Systems · doi:10.5220/0002517804090412 · Cited by 6
Representing interaction of agents at different time granularities
Mota, E. S., & Robertson, D. (2002) · doi:10.1109/time.1996.555684 · Cited by 6
Chain-split evaluation in deductive databases
Han, J. (1995) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.382296 · Cited by 6
Horn extended feature structures
Hegner, S. J. (1991) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.3115/977180.977187 · Cited by 6
A method for designing decision support systems for operational planning
Eiben, A. E. (1991) · TU/e Research Portal · doi:10.6100/ir354562 · Cited by 6
Implementations of program composition operations
Antonio Brogi, A., Chiarelli, A., Mancarella, P. M., et al. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58402-1_21 · Cited by 6
Hasta-La-Vista: Termination analyser for logic programs
Serebrenik, A., & Schreye, D. D. (2003) · Lirias (KU Leuven) · Cited by 6
Combining Knowledge Systems and Hypermedia for User Co-operation and Learning
Edman, A. (2001) · KTH Publication Database DiVA (KTH Royal Institute of Technology) · Cited by 6
Knowledge Refactoring for Inductive Program Synthesis
Dumancic, S., Guns, T., & Cropper, A. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i8.16893 · Cited by 2
Semantic knowledge bases for financial accounting standards
Gangolly, J. S., Hedley, T. P., & Wong, C.-T. (1991) · Expert Systems with Applications · doi:10.1016/0957-4174(91)90092-s · Cited by 5
Programming medical rosters in Prolog
Rosenberg, S. J. (1988) · Medical Informatics · doi:10.3109/14639238809010099 · Cited by 5
Identification of biological transition systems using meta-interpreted logic programs
Bain, M., & Srinivasan, A. (2018) · Machine Learning · doi:10.1007/s10994-018-5709-1 · Cited by 6
Gilmore, P. C. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316755808 · Cited by 5
Precedences in specifications and implementations of programming languages
Aasa, A. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54444-5_98 · Cited by 5
A framework for a modular modelling approach for agroforestry
Muetzelfeldt, R. I. (1995) · Forestry sciences · doi:10.1007/978-94-017-0681-0_11 · Cited by 5
Towards declarative GIS analysis
Aquilino, D., Renso, C., & Turini, F. (1996) · doi:10.1145/258319.258346 · Cited by 5
A note on interpretations for federated languages and the use of disquotation
Kimbrough, S. O. (2005) · International Conference on Artificial Intelligence and Law · doi:10.1145/1165485.1165488 · Cited by 5
Explanation-Based Learning: A survey
Wusteman, J. (1992) · Artificial Intelligence Review · doi:10.1007/bf00155763 · Cited by 5
Logic modeling with partially ordered preferences
Widmeyer, G. R. (1988) · Decision Support Systems · doi:10.1016/0167-9236(88)90099-1 · Cited by 5
Meta-variables in Logic Programming, or in Praise of Ambivalent Syntax
Apt, K. R., & Ben-Eliyahu, R. (1996) · Fundamenta Informaticae · doi:10.3233/fi-1996-281202 · Cited by 6
Protein Folding in CLP( $\mathcal{FD}$ ) with Empirical Contact Energies
Palù, A. D., Agostino Dovier, A., & Fogolari, F. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24662-6_14 · Cited by 5
Automatic Generation of Test Cases and Test Purposes from Natural Language
Nogueira, S., Araujo, H., Araujo, R. B. S., et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29473-5_9 · Cited by 5
Programming and Visually Impaired People
Kopeček, I., & Strejčková, A. (1998) · Cited by 5
Maximum entropy in Nilsson's probabilistic logic
Kane, T. B. (1989) · Edinburgh Napier Research Repository (Edinburgh Napier University) · Cited by 5
LicenseScript: a logical language for digital rights management
Chong, C. N., Corin, R., Doumen, J. M., et al. (2006) · Annals of Telecommunications · doi:10.1007/bf03219910 · Cited by 5
Parallel symbolic computation in ACE
Pontelli, E., & Gupta, G. (1997) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018929805694 · Cited by 5
An icon-based design method for Prolog
Karam, G. M. (1988) · IEEE Software · doi:10.1109/52.17802 · Cited by 5
End-user programming in multiple languages
Hague, R. (2021) · doi:10.48456/tr-651 · Cited by 5
Inductive Verification and Validation of the KULRoT RoboCup Team
Driessens, K., Jacobs, N., Cossement, N., Monsieurs, P., & Raedt, L. D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48422-1_16 · Cited by 5
Class-management using Logical Queries, Application of a Reflective User Interface Builder
Wuyts, R. (1996) · Cited by 5
Decidability of logic program semantics and applications to testing
Ruggieri, S. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61756-6_96 · Cited by 5
ASPEN: A stream processing environment
Livezey, B. K., & Muntz, R. R. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51285-3_53 · Cited by 5
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
