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 601–700 of 1,000
A practical implementation of DCGs
Paakki, J. (1991) · Lecture notes in computer science · doi:10.1007/3-540-53669-8_91 · Cited by 5
A methodological approach to policy refinement in policy-based management systems
Rubio‐Loyola, J. (2007) · doi:10.5821/dissertation-2117-94215 · Cited by 5
Acquiring object-knowledge for learning systems
Raedt, L. D., Feyaerts, J., & Bruynooghe, M. (1991) · Lecture notes in computer science · doi:10.1007/bfb0017019 · Cited by 5
Automating changes of data type in functional programs
Richardson, J. (2002) · doi:10.1109/kbse.1995.490132 · Cited by 5
EDUCATIONAL EVALUATION OF FEATURE-BASED MODELLING IN A PROBLEM SOLVING DOMAIN
Webb, G. I., Cumming, G., & Richards, T. J. (1990) · Cited by 5
Optimization by non-deterministic, lazy rewriting
Narain, S. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51081-8_117 · Cited by 5
Analogy-Based Multiple Process Planning System with Resource Conflicts
Ben‐Arieh, D., & Wu, C.-H. J. (1999) · International Journal of Flexible Manufacturing Systems · doi:10.1023/a:1008044723365 · Cited by 5
Boeck, P. D., & Charlier, B. L. (1994) · Workshops in computing · doi:10.1007/978-1-4471-3234-9_19 · Cited by 5
A versatile module system for Prolog mapped to flat prolog
Karali, I., Pelecanos, E., & Halatsis, C. (1993) · doi:10.1145/162754.168687 · Cited by 5
Software tools for micro‐analysis of programs
Cohen, J., & Weitzman, A. (1992) · Software Practice and Experience · doi:10.1002/spe.4380220905 · Cited by 5
Empirical study of expert system development
Preece, A. D., & Moseley, L. G. (1992) · Knowledge-Based Systems · doi:10.1016/0950-7051(92)90004-y · Cited by 5
Symbolic reasoning in object extraction
Meisels, A., & Mintz, D. (1990) · Computer Vision Graphics and Image Processing · doi:10.1016/0734-189x(90)90087-c · Cited by 5
The processing strategy for the NF2 relational frc-interface
Niemi, T., & Järvelin, K. (1996) · Information and Software Technology · doi:10.1016/0950-5849(95)01041-6 · Cited by 5
The functional side of logic programming
Massimo Marchiori, B. (1995) · doi:10.1145/224164.224181 · Cited by 5
“As a simple example, the in nite list of naturals [0;s(0); s(s(0));: : :] can be expressed in a functional program just using the de nition of natural number ([26]): natural(0) natural(s(X)) natural(X) where the moding is natural(out).”
MethodA language for specifying program transformations
Hildum, D. W., & Cohen, J. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.55091 · Cited by 5
Solving optimisation problems in the Aurora or-parallel Prolog system
Szeredi, P. (1991) · Lecture notes in computer science · doi:10.1007/3-540-55038-0_4 · Cited by 5
A set of design guidelines for object-oriented deductive systems
Wong, S. T. C., & Wilson, J. L. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.243518 · Cited by 5
The Logic Programming Paradigm and PrologPreprint
Apt, K. R. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0107013 · Cited by 5
Compilation of bottom-up evaluation for a pure logic programming language
Clayton, R. (2005) · Research Commons (University of Waikato) · Cited by 5
A Robotics Task Scheduler - TAPAS
Focant, G., Fontaine, B., Steinicke, L., et al. (2006) · Springer eBooks · doi:10.1007/3-540-26415-9_123 · Cited by 4
A paradigm for computer-assisted radiology resident rotation scheduling
Wong, S. T. C., Huang, H. K., Goldstein, R. B., et al. (1995) · Academic Radiology · doi:10.1016/s1076-6332(05)80414-3 · Cited by 4
Hmida, H. B., Boochs, F., Cruz, C., & Nicolle, C. (2012) · IEEE International Conference on Computer Science and Automation Engineering · doi:10.1109/csae.2012.6272992 · Cited by 4
An abstract framework for globalising interactive systems
Stathis, K., & Sergot, M. J. (1998) · Interacting with Computers · doi:10.1016/s0953-5438(97)00027-1 · Cited by 4
Diagnosis and semi-automatic correction of detected design inconsistencies in source code
Castro, S., Brichau, J., & Mens, K. (2009) · doi:10.1145/1735935.1735938 · Cited by 4
Proving Arrow’s theorem by PROLOG
Indo, K. (2007) · Computational Economics · doi:10.1007/s10614-007-9086-2 · Cited by 4
Concurrent Tabling: Algorithms and Implementation
Marques, R. F. (2007) · Cited by 4
Inferring Definite-Clause Grammars to Express Multivariate Time Series
Guimarães, G., & Pereira, L. M. (2005) · Lecture notes in computer science · doi:10.1007/11504894_46 · Cited by 4
The Automated Refinement of a Requirements Domain Theory
McCluskey, T. L., & West, M. M. (2001) · Automated Software Engineering · doi:10.1023/a:1008793523863 · Cited by 4
Discovery and Uncertainty in Semantic Web Services
Martín-Recuerda, F., & Robertson, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89765-1_7 · Cited by 4
A Default Inheritance Hierarchy for Computing Hebrew Verb Morphology
Finkel, R. A., & Stump, G. (2006) · Literary and Linguistic Computing · doi:10.1093/llc/fqm004 · Cited by 4
Teaching AI through prolog programming techniques
Hietala, P. (1993) · Computers & Education · doi:10.1016/0360-1315(93)90080-3 · Cited by 4
Using limited common sense knowledge to guide knowledge acquisition for information agents
Gao, X., & STERLING, L. S. (1997) · Swinburne figshare (Swinburne University of Technology) · doi:10.25916/sut.26275537 · Cited by 4
Self-citationArkoudas, K. (2005) · Cited by 4
Temporal Authorization in the Simplified Event Calculus
Barker, S. (2000) · IFIP advances in information and communication technology · doi:10.1007/978-0-387-35508-5_18 · Cited by 4
“For efficiency reasons, ground instances of the initiates, terminates and ended predicates may be memoized [9], by dynamic assertion [13], when a holds(access(S,P,O)) request is first evaluated.”
BackgroundMerging news reports that describe events
Hunter, A., & Summerton, R. (2005) · Data & Knowledge Engineering · doi:10.1016/j.datak.2005.06.005 · Cited by 4
Expert System Based Training for Emergency Management
Sharit, J., Chen, S., & Lin, D. (1993) · Journal of Computing in Civil Engineering · doi:10.1061/(asce)0887-3801(1993)7:1(6 · Cited by 4
Konczykowska, A., MULAWKA, J. J., & Bon, M. (2003) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.1988.15270 · Cited by 4
Putting Declarative Meta Control to Work
Hogan, A., Stolle, R., & Bradley, E. (1998) · doi:10.21236/ada436803 · Cited by 4
Exploring the Coordination Space with LO
Castellani, S., & Ciancarini, P. (1994) · Cited by 4
Logic programs with equational type specifications
Hanus, M. (1990) · Lecture notes in computer science · doi:10.1007/3-540-53162-9_31 · Cited by 4
Parameterized Logic Programs where Computing Meets Learning
Sato, T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44716-4_3 · Cited by 4
Semantics for Temporal Annotated Constraint Logic Programming
Raffaetà, A., & Frühwirth, T. (2000) · Applied logic series · doi:10.1007/978-94-011-4040-9_9 · Cited by 4
Termination analysis of logic programs using acceptability with general term ordersPreprint
Serebrenik, A., & Schreye, D. D. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0011025 · Cited by 4
Machine Translation of English Dialogue into Korean on the Basis of Contextual Information
Lee, D.-Y. (1999) · Seoul National University Open Repository (Seoul National University) · Cited by 4
Design and analysis of hardware for high-performance prolog
Holmer, B. K., Sano, B., Carlton, M., et al. (1996) · The Journal of Logic Programming · doi:10.1016/s0743-1066(96)88981-3 · Cited by 4
On logic programs that do not fail
Pedreschi, D., & Ruggieri, S. (1999) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00115-x · Cited by 4
A knowledge representation language for university requirements
Golumbic, M. C., Markovich, M., & Tiomkin, M. (1991) · Decision Support Systems · doi:10.1016/0167-9236(91)90075-m · Cited by 4
Agent-Oriented Programming in Linear Logic
Amin, A.-A., Harland, J., & Winikoff, M. (1999) · Cited by 4
Deductive-ER: deductive entity-relationship data model and its data language
Han, J., & Li, Z. (1992) · Information and Software Technology · doi:10.1016/0950-5849(92)90031-j · Cited by 4
Polynomial-time learnability of logic programs with local variables from entailment
Rao, M. R. K. K., & Sattar, A. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00270-x · Cited by 4
PETINA—tour generation using the ElipSys inference system
Stamatopoulos, P., Karali, I., & Halatsis, C. (1992) · doi:10.1145/143559.143657 · Cited by 4
A priori analysis of natural language queries
Spiegler, I., & Elata, S. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90001-5 · Cited by 4
Opium — An advanced debugging system
Ducassé, M. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55930-2_21 · Cited by 4
A Practical Approach for Logic Program Analysis and Transformation
Vasconcelos, W. W., & Meneses, E. X. (2000) · Lecture notes in computer science · doi:10.1007/10720076_8 · Cited by 4
Learning and Deduction in Neural Networks and Logic
Komendantskaya, E. (2007) · Cited by 4
A theory of first-order built-in's of prolog
Apt, K. R., Marchiori, E., & Catuscia Palamidessi, A. (2005) · Springer eBooks · doi:10.1007/bfb0013820 · Cited by 4
A knowledge-based system for multi-layer channel routing
Vakil, D., Zargham, M. R., & Danhof, K. J. (2003) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/cmpsac.1988.17208 · Cited by 4
Formal models of business process reengineering for design and design validation
Atefi, K. (1997) · Library and Archives Canada (Government of Canada) · Cited by 4
Compositionality in probabilistic logic modelling for biological sequence analysis
Lassen, O. T. (2011) · RUCforsk (Roskilde University) · Cited by 4
Integrated optimization of operational and tactical planning for log production
Ogweno, D. C. O. (1995) · University of Canterbury Research Repository (University of Canterbury) · doi:10.26021/2112 · Cited by 4
Aggregation and constraint processing in lifted probabilistic inference
Kisyński, J. (2010) · cIRcle (University of British Columbia) · doi:10.14288/1.0051829 · Cited by 4
Metalogic for state oriented programming
Antonio Brogi, A., & Turini, F. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56454-3_10 · Cited by 3
On definite program answers and least Herbrand models
Drabent, W. (2016) · Theory and Practice of Logic Programming · doi:10.1017/s1471068416000089 · Cited by 3
Provably Correct Code Generation: A Case Study
Wang, Q., & Gupta, G. (2005) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2004.11.008 · Cited by 3
Jacquet, J.-M., Linden, I., & Staicu, M.-O. (2015) · Science of Computer Programming · doi:10.1016/j.scico.2015.08.003 · Cited by 3
Classifications of subjects with the language PROLOG
Buzzi, R. (1989) · Computer Methods and Programs in Biomedicine · doi:10.1016/0169-2607(89)90146-6 · Cited by 3
da Silva, A. F., & Costa, V. S. (2006) · Lecture notes in computer science · doi:10.1007/11799573_49 · Cited by 3
Semantic Constraints in a Syntactic Parser: Queries-Answering to Databases
Moreno, L., & Palomar, M. (1992) · Database and Expert Systems Applications · doi:10.1007/978-3-7091-7557-6_27 · Cited by 3
A Declarative Approach for Software Modeling
Goldberg, M., & Wiener, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27694-1_3 · Cited by 3
An Adaptation of Dynamic Slicing Techniques for Logic Programming
Vasconcelos, W. W., & Aragão, M. A. T. (1998) · Lecture notes in computer science · doi:10.1007/10692710_16 · Cited by 3
Minimal negation and Hereditary Harrop formulae
Momigliano, A. (2005) · Springer eBooks · doi:10.1007/bfb0023886 · Cited by 3
What exactly is wrong and why? Tutorial Dialogue for Intelligent CALL Systems
Klenner, M., & Visser, H. (2003) · Linguistik Online · doi:10.13092/lo.17.787 · Cited by 3
TANDEM - a design method for integrating web services into multi-agent systems
Goschnick, S., Balbo, S., STERLING, L. S., et al. (2006) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/1160633.1160799 · Cited by 3
Self-citationOn complementary principles of object-oriented constraint programming
Semenov, V. A., Dragalov, K. V., Ilyin, D. V., et al. (2010) · Programming and Computer Software · doi:10.1134/s0361768810050026 · Cited by 3
On using scheme to introduce prolog
Wick, M. R., & Stevenson, D. E. (2006) · ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/1121341.1121356 · Cited by 3
Schema induction for logic program synthesis
Tinkham, N. L. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00055-6 · Cited by 3
Spatial inference with an interchangeable rule format
Nikkilä, R., Nash, E., Wiebensohn, J., et al. (2013) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2012.750323 · Cited by 3
Reverse engineering collaboratory: a logic-based tool for monitoring the quality of programs
Maresca, P. (2000) · Engineering Applications of Artificial Intelligence · doi:10.1016/s0952-1976(99)00032-9 · Cited by 3
Automated detection of naming conflicts in schema integration: experiments with quiddities
Bhargava, H. K., & Beyer, R. M. (1992) · Proceedings of the ... Annual Hawaii International Conference on System Sciences/Proceedings of the Annual Hawaii International Conference on System Sciences · doi:10.1109/hicss.1992.183243 · Cited by 3
A parallel logic language for transaction specification in multidatabase systems
Kühn, E., Elmagarmid, A. K., Leu, Y., et al. (1995) · Journal of Systems Integration · doi:10.1007/bf01974950 · Cited by 3
Robust parsing and spoken negotiative dialogue with databases
Boye, J., & Wirén, M. (2006) · Natural Language Engineering · doi:10.1017/s1351324906004402 · Cited by 3
Singular and plural functions for functional logic programming
Riesco, A., & Rodríguez-Hortalá, J. (2012) · Theory and Practice of Logic Programming · doi:10.1017/s147106841200004x · Cited by 3
Granularity control for distributed execution of logic programs
Xirogiannis, G. (2002) · International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1998.679506 · Cited by 3
“Consider the QuickSort program (as presented in [20] page 56) and table 1.”
A neural propositional reasoner that is goal-driven and works without pre-compiled knowledge
Lima, P. M. V. (2002) · Brazilian Symposium on Neural Networks (SBRN) · doi:10.1109/sbrn.2000.889749 · Cited by 3
Knowledge base compilation and the language design game
Sack, W. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55606-0_29 · Cited by 3
INDED: a distributed knowledge-based learning system
Seitzer, J. M., Buckley, J. P., & Pan, Y. F. (2000) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.889105 · Cited by 3
A Network Representation of First-Order Logic That Uses Token Evolution for Inference
Suzuki, H., Yoshida, M., & Sawai, H. (2014) · Journal of information science and engineering · doi:10.6688/jise.2014.30.3.8 · Cited by 3
Eliminating Irrelevant Non-determinism in Functional Logic Programs
Antoy, S., & Hanus, M. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-51676-9_1 · Cited by 3
Semi-Automatic Design and Prototyping of Adaptive User Interfaces
Martins, F. M. J. (2000) · Cited by 3
Concept of an Interactive Web Portal for Teaching Prolog.
Nalepa, G. J., & Wojnicki, I. (2008) · The Florida AI Research Society · Cited by 3
Simulation and Testbeds of Autonomous Robots in Harsh Environments
Stansbury, R. S., Akers, E. L., Harmon, H. P., & Agah, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-68951-5_4 · Cited by 3
A program specialiser for meta-level compositions of logic programs
Antonio Brogi, A., & Contiero, S. (1998) · New Generation Computing · doi:10.1007/bf03037314 · Cited by 3
“Let us rst introduce a simple extension of the vanilla meta-interpreter [42], where a two-argument predicate Demo is used to denote provability.”
BackgroundMethodThe Prolog Debugger and Declarative Programming
Drabent, W. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-45260-5_12 · Cited by 3
Comparative Study of the Inference Mechanisms in PROLOG and SPIDER
Golemanova, E., Golemanov, T., & Kratchanov, K. (2018) · TEM Journal · doi:10.18421/tem74-30 · Cited by 3
An Introductory Course on Constraint Logic Programming
Liñares, M. C., Hermenegildo, M. V., Carrillo, F. B., et al. (1998) · Hispana · Cited by 3
A refinement of import/export declarations in modular logic programming and its semantics
Karali, I., & Halatsis, C. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59293-8_215 · Cited by 3
Improving distributed unification through type analysis
Lamma, E., Mello, P., Stefanelli, C., et al. (1997) · Lecture notes in computer science · doi:10.1007/bfb0002871 · Cited by 3
Universal Finiteness and Satisfiability.
Mumick, I. S., & Shmueli, O. (1994) · Cited by 3
Learning linearly-moded programs from entailment
Rao, M. R. K. K., & Sattar, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0095294 · Cited by 3
Implementing Constraint Handling Rules as a Domain-Specific Language Embedded in JavaPreprint
Ivanović, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.3939 · Cited by 3
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
