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 901–1,000 of 1,000
Handling Probabilistic Uncertainty in Constraint Logic Programming
Valkovsky, V. B., Savvin, K. O., & Gerasimov, M. B. (1998) · Springer eBooks · doi:10.1007/978-1-4471-0427-8_26 · Cited by 1
Combining an improvement to PARMA trailing with analysis in HAL
Schrijvers, T., & Demoen, B. (2002) · Lirias · Cited by 1
Using Prolog for Transforming XML DocumentsPreprint
Haberland, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.10817 · Cited by 1
SLD-resolution without occur-check, an examplePreprint
Drabent, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.01911 · Cited by 1
Coupled resolution engines for programming knowledge based systems in logic
Taylor, H. (1989) · Cited by 1
Designing an intelligent prolog tutor
Lee, M. C. (2005) · Springer eBooks · doi:10.1007/bfb0020896 · Cited by 1
Efficient Legacy Data Utilization
Russomanno, D. J. (2002) · Expert Systems · doi:10.1016/b978-012443880-4/50074-0 · Cited by 1
A Survey of Basic Issues of Parallel Execution on a Distributed System
Evans, D. J. V., & Goscinski, A. M. (1995) · Cited by 1
Real-Time Persistent Queues and Deques with Logic Variables (Declarative Pearl)
Bouma, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29822-6_8
Chapter 2 Programming languages
Bal, H. E., & Grune, D. (1992) · Handbooks in operations research and management science · doi:10.1016/s0927-0507(05)80199-9
Coordination and Logic Programming
Mahr, B., & Tolksdorf, R. (1993) · Informatik aktuell · doi:10.1007/978-3-642-78486-6_97
Logic-Programming Approach to CMOS Design: Describing Gate–Switch Networks in Predicates
Люлькин, А. Е. (2002) · Russian Microelectronics · doi:10.1023/a:1015458903180
Using Prolog to Animate Mathematics
Knott, R. (1992) · Springer eBooks · doi:10.1007/978-94-011-2562-8_8
Copying garbage collection for WAM-based prolog systems
Vandeginste, R. (2007) · Lirias
Planungsmethoden der Künstlichen Intelligenz zur Lösung betriebswirtschaftlicher Steuerungsprobleme
Hruschka, H. (1988) · Gabler Verlag eBooks · doi:10.1007/978-3-322-90580-2_10
Efficient implementation of general negation using abstract interpretation
Muñoz-Hernández, S., Navarro, J. J. M., & Hermenegildo, M. V. (2000) · Hispana
Generator and Search Objects in Java
Allison, L. (2000)
L'enseignement de la programmation logique à l'Ecole des Mines de Nantes
Jussien, N. (2003) · HAL
Mathematics of Logic Programming
Ebbinghaus, H. ‐., & Flum, J. (2001) · Springer eBooks · doi:10.1007/978-94-015-9833-0_5
Polymorphic type checking with subtypes in Prolog
Frühwirth, T. (1990) · Lecture notes in computer science · doi:10.1007/3-540-52531-9_131
COMBINING REASON AND AUTHORITY FOR AUTHORIZATION OF PROOF-CARRYING CODE
Whitehead, N. (2004)
Introduction to the Literature on Programming Language Design
Leavens, G. T. (1996) · Iowa State University Digital Repository (Iowa State University)
On logic programming interpretations of Dislog: Programming long-distance dependencies in logic
Saint‐Dizier, P. (1990) · Lecture notes in computer science · doi:10.1007/3-540-53162-9_42
Proof Manipulations for Logic Programming Proof Systems
Lutovac, T., & Harland, J. (2007)
Analysis and transformation of logic programs
Post, K. (1994)
Semantic Interpretation of Natural Language in PROLOG: Logical Forms
Palomar, M., Moreno, L., & Pascual, A. (1991) · Database and Expert Systems Applications · doi:10.1007/978-3-7091-7555-2_56
Generic associative memory for information retrieval
Choi, C. H. B., & Lee, D. L. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51324-8_37
Entorno de soporte al aprendizaje activo en procesamiento de lenguaje
Rodríguez, J. L. S., & Crespo, A. F.-V. (2007) · Universidad Complutense de Madrid eBooks
Horn Clauses and Feature-Structure Logic: Principles and Unification Algorithms
Hegner, S. J. (2001)
Semantics—based Partial Evaluation of Prolog Programs
Ross, B. J. (1992) · Workshops in computing · doi:10.1007/978-1-4471-3494-7_16
Trusted Theorem Proving: A Case Study in SLD-Resolution
Arkoudas, K., & Shivers, O. (2008) · Communications in computer and information science · doi:10.1007/978-3-540-88479-8_56
SweMas Toward a Practical Multi-agent Framework Utilizing the Semantic Web
Lee, J. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39896-7_11
Muñoz, A. D. D., Vidal, Á. N., & Morente, F. P. (2009)
SML: Symbolic manipulation language
Karagiannis, D., & Salzmann, W. (1990) · Information Systems · doi:10.1016/0306-4379(90)90019-l
Mathuria, A. (1994) · Research Online (University of Wollongong)
Robot Learning of Domain Specific Knowledge from Natural Language Sources
eh, I., Pohorec, S., Mernik, M., et al. (2010) · Sciyo eBooks · doi:10.5772/10249
Deriving contingencies among diagnostic tests with Prolog by code examination
Denney, R. (1987) · Fall joint computer conference · doi:10.5555/42040.42046
Compiling Evaluable Functions in the Godel Programming Language
Shapiro, D. L. (2000) · doi:10.15760/etd.6977
Implementing a meta-logical scheme
Lim, P., & Morley, D. (2005) · Springer eBooks · doi:10.1007/bfb0024179
Concurrent execution of Prolog transaction
Takizawa, M., & Miyajima, K. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19426-6_20
How Concurrent Logic Programming Could Benefit from Using Linda-like Operations
Czajkowski, G., & Zieliński, K. (1994) · Springer eBooks · doi:10.1007/978-1-4615-2690-2_4
A Truly Declarative Prolog-Like Language
Papakonstantinou, G., Panayiotopoulos, T., & Sideri, M. (1991) · Springer eBooks · doi:10.1007/978-94-011-2560-4_6
Applications of Unfolding in Prolog Programming
Jones, J. (1993) · Workshops in computing · doi:10.1007/978-1-4471-3560-9_13
Efficient Compression of Prolog ProgramsPreprint
Suciu, A., & Pusztai, K. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0603100
Developing a Tool for Memoizing Functions in C++ (C++ Toolbox).
McNamee, P., & Hall, M. (1998) · ACM SIGPLAN Notices
A Polymorphic Groundness Analysis of Logic ProgramsPreprint
Lu, L. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9811001
Learnability of Simply-Moded Logic Programs from Entailment
Rao, M. R. K. K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30502-6_9
Efficient evaluation of linear recursions with function symbols in deductive databases
Han, J., & Wang, Q. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54563-8_77
Relational and Allegorical Semantics for Constraint Logic Programming
Arias, G., & Arias, E. J. G. (2012)
Modeling Meta-logical Features in a Calculus with Frozen Variables
Elbl, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45504-3_8
Efficient Prolog: A practical guide
Covington, M. A. (1989)
Synchronising Changes to Design and Implementation using a Declarative Meta-Programming Language
Wuyts, R. (n.d.) · Bern Open Repository and Information System (University of Bern) · doi:10.7892/boris.104816
Neural Extension of Fuzzy Prolog
Lieskovský, M. (2000) · Physica-Verlag eBooks · doi:10.1007/978-3-7908-1844-4_69
An expert system for drafting contractual documents in Public Administration Procurement Operations
Brouwers, D., Gerard, J., & Montero, É. (1990) · Database and Expert Systems Applications · doi:10.1007/978-3-7091-7553-8_48
Der SLD-Kalkül (Logik-Programmierung)
Schenke, M. (2013) · Springer eBooks · doi:10.1007/978-3-8348-2295-6_4
Parallelism in Logic Programming and Scheduling Issues
Geyer, C. F. R., Mangan, P. K. V., & Dutra, I. (2002) · Applied optimization · doi:10.1007/978-1-4757-3609-0_8
Efficient Models for Data Storage with References
Artemov, S. N., & Krupski, V. N. (1997) · doi:10.21236/ada344311
Data flow coherence criteria in ILP tools
Muresan, S., Muresan, T., & Potolea, R. (2002) · doi:10.1109/ictai.2001.974463
Leone, N., Palopoli, L., & Romeo, M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56804-2_22
Sadegh-Zadeh, K. (2015) · Philosophy and medicine · doi:10.1007/978-94-017-9579-1_17
Vasconcelos, W. W., & Fuchs, N. E. (1996)
Overcoming Misleads In Logic Programs by Redefining NegationPreprint
El-dosuky, M. A., Hamza, T. T., Rashad, M. Z., et al. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.6148
Gentzen-style characterizations of Negation as Failure
Plaza, J. A. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57322-4_17
Solving logic problems with object-oriented constraint logic programming
Ovans, R., & Sidebottom, S. (2002) · IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM) · doi:10.1109/pacrim.1993.407253
Computing and Information Management in Micropropagation
Hempel, M. (1991) · Biotechnology in agriculture and forestry · doi:10.1007/978-3-642-76415-8_26
Lee, D.-Y. (2006) · Seoul National University Open Repository (Seoul National University)
Explanation-based reuse of prolog programs
Koga, Y., Hirowatari, E., & Arikawa, S. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58520-6_61
Min, B.-K., & Chang, S. H. (1993) · Reliability Engineering & System Safety · doi:10.1016/0951-8320(93)90120-n
A dataflow Prolog execution model and its architectural support
Kang Zhang, A., & Thomas, R. (1991) · Microprocessing and Microprogramming · doi:10.1016/0165-6074(91)90023-m
A logic-based framework for address interpretation and rectification
Occeña, L. G., & Tang, L.-C. (1992) · Computers in Industry · doi:10.1016/0166-3615(92)90127-9
Sublist assertions for listless and lazy evaluation
Jayaraman, B. (1992) · Computer Languages · doi:10.1016/0096-0551(92)90003-6
Transputer network with flexible topology
Knoppers, P., van de Goor, A. J., Gunhildsbu, O. M., et al. (1988) · Microprocessing and Microprogramming · doi:10.1016/0165-6074(88)90066-x
Metalevel and Constraint Technology in a Pure Logic Language
Babb, E. (1992) · Springer eBooks · doi:10.1007/978-94-011-2562-8_1
Issues of non-determinism in PROLOG and the Committed Choice Non-Deterministic logic languages
Trehan, R., & Wilk, P. F. (1990) · Artificial Intelligence Review · doi:10.1007/bf00140677
Ada tasking model and Prolog predication
Ncube, C. C. (1988) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/43846.43854
A prescribed cut for Prolog that ensures soundness
Lilly, H. A., & Bryant, B. R. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90014-t
Automating the TANDEM Design Method in End-User Programming Environments
Goschnick, S. (2012) · International Journal of People-Oriented Programming · doi:10.4018/ijpop.2012010102
Lundqvist, K., & Wall, G. (1997) · ACM SIGAda Ada Letters · doi:10.1145/261374.261388
A geometric interpretation of LD-resolution
Banerjee, R. N., & Bujosa, A. (2004) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.03.007
Thinking in parallel: four steps to Parlog
Conlon, T. (1992) · Artificial Intelligence Review · doi:10.1007/bf00155765
Rovenţa, E. (1999) · International Journal of General Systems · doi:10.1080/03081079908935237
A Guide for Manual Construction of Difference-List Procedures
Geske, U., & Goltz, H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00675-3_1
Roach, D., & Berghel, H. (1992) · doi:10.1145/143559.143658
An efficient multiple predicate learner
Xiaolong, Z., & Numao, M. (1998) · Journal of Computer Science and Technology · doi:10.1007/bf02943195
An operational semantic approach to continuation style interpreter of logic programs
Shih, T. K. (1998) · Information Sciences · doi:10.1016/s0020-0255(97)10040-8
The expressive power of side effects in prolog
Makowsky, J. A., Grégoire, J., & Sagiv, S. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90043-3
Expert systems: The end of the beginning
Michie, D. (1991) · AI & Society · doi:10.1007/bf01891719
Lifting Term Rewriting Derivations in Constructor Systems by Using Generators
Riesco, A., & Rodríguez-Hortalá, J. (2015) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.173.7
Intelligent tutoring system for reading mathematical expressions
Nakamura, M., Iwane, N., & Otsuki, S. (2000) · Systems and Computers in Japan · doi:10.1002/1520-684x(200009)31:10
Applications of Prolog to represent physical and chemical objects — a tutorial introduction
Cabrol‐Bass, D. (1990) · Computer Physics Communications · doi:10.1016/0010-4655(90)90105-a
Developing Critical Insights into Artificial Intelligence
Kerins, J. (2005) · Innovation in Teaching and Learning in Information and Computer Sciences · doi:10.11120/ital.2005.04030003
VIP — eine integrierte Programmierumgebung für Prolog
Krall, A., & Kühn, E. (1987) · Informatik-Fachberichte · doi:10.1007/978-3-642-46620-5_12
The effects of restricted syntax on menu-based interaction
Hedeen, A. (1988) · ACM SIGART Bulletin · doi:10.1145/44418.44422
Design verification of digital systems based on logic programming
Dotan, Y., & Arazi, B. (1990) · Computers & Electrical Engineering · doi:10.1016/0045-7906(90)90018-b
ASPEN: a concurrent stream processing environment
Livezey, B. K., & Muntz, R. R. (1990) · Future Generation Computer Systems · doi:10.1016/0167-739x(90)90019-a
Yalçinalp, L. Ü. (1993) · doi:10.1145/162754.168690
Raedt, L. D., Feyaerts, J., & Bruynooghe, M. (1992) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139208953748
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