Fifty Years of Prolog and Beyond

DOI10.1017/s1471068422000102arXiv2201.10816OpenAlexW4280605585MaRDI QIDQ6063890

No author found.

Publication date: 12 December 2023

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.10816

zbMATH Keywords

evolutionvisionportabilitylogic programming systemsprologrationale

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Reactive computing as model generation
• A polymorphic type system for Prolog
• Negation and control in PROLOG
• Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks
• A Prolog technology theorem prover: A new exposition and implementation in Prolog
• Probabilistic Horn abduction and Bayesian networks
• Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
• Introducing global constraints in CHIP
• lean\(T^ AP\): Lean tableau-based deduction
• Logic programs with stable model semantics as a constraint programming paradigm
• Lazy stream manipulation in prolog via backtracking: the case of \textbf{2P-Kt}
• Linear resolution with selection function
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• The Boolean Constraint Solver of SWI-Prolog (System Description)
• A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs
• Statistical Relational Artificial Intelligence: Logic, Probability, and Computation
• Safe & Efficient Gradual Typing for TypeScript
• Logic Programming in the 1970s
• Programming with Higher-Order Logic
• The YAP Prolog system
• SICStus Prolog—The first 25 years
• SWI-Prolog
• The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines
• ECLⁱPS^e – From LP to CLP
• XSB: Extending Prolog with Tabled Logic Programming
• The language features and architecture of B-Prolog
• An overview of Ciao and its design philosophy
• On the implementation ofGNU Prolog
• A design and implementation of the Extended Andorra Model
• Infinite Computation, Co-induction and Computational Logic
• Compiling constraints in clp(FD)
• Absys: the first logic programming language —A retrospective and a commentary
• SWI-Prolog and the web
• Constraint Logic Programming Using ECLⁱPS^e
• Coinductive Logic Programming and Its Applications
• Constraint Handling Rules
• PARLOG: parallel programming in logic
• A logical reconstruction of Prolog II
• Total Precedence Relations
• The Semantics of Predicate Logic as a Programming Language
• Binary Decision Diagrams
• Algorithm = logic + control
• Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
• Design, implementation, and evaluation of the constraint language cc(FD)
• The well-founded semantics for general logic programs
• 1983–1993: The wonder years of sequential Prolog implementation
• Inductive Logic Programming: Theory and methods
• The execution algorithm of mercury, an efficient purely declarative logic programming language
• Logic program specialisation through partial deduction: Control issues
• Constraint Answer Set Programming without Grounding
• Description and Optimization of Abstract Machines in a Dialect of Prolog
• Semantic code browsing
• Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
• On applying or-parallelism and tabling to logic programs
• Coding guidelines for Prolog
• Guarded horn clauses
• Using SWISH to Realize Interactive Web-based Tutorials for Logic-based Languages
• The DLV system for knowledge representation and reasoning
• Logic Programming
• Logic Programming
• Logic Programming
• Hybrid type checking
• Delimited continuations for prolog
• Modules for Prolog Revisited
• Improving the ISO Prolog Standard by Analyzing Compliance Test Results
• Coinductive Logic Programming
• Logic Programming
• Logic Programming
• Programming finite-domain constraint propagators in Action Rules
• Programming Languages and Systems
• A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
• Towards Typed Prolog
• A Machine-Oriented Logic Based on the Resolution Principle
• Nondeterministic Algorithms
• An efficient context-free parsing algorithm
• From tuple spaces to tuple centres
• Resolution for skeptical stable model semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item