A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3216378269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commutative logic. I: The multiplicative fragment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming with Focusing Proofs in Linear Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3357521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical semantics for depth-first Prolog with ground negation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability in Elementary Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and negation: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new definition of SLDNF-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abella: A System for Reasoning about Relational Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: lean\(T^ AP\): Lean tableau-based deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating between implicit and explicit versions of proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical definition of full Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focused linear logic and the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structuring proof search for first order linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient resource management for linear logic proof search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and Intuitionistic Subexponential Logics Are Equally Expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magically Constraining the Inverse Method Using Dynamic Polarity Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical characterization of forward and backward chaining in the inverse method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: HiLog: A foundation for higher-order logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic framework for proof evidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formulation of the simple theory of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Duality of Computation under Focus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functionality in Combinatory Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid and subexponential linear logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: ELPI: Fast, Embeddable, $$\lambda $$ Prolog Interpreter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient context-free parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order unification with dependent function types / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polarized \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear concurrent constraint programming: Operational and phase semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing tactics and tacticals in a higher-order logic programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: N-Prolog: An extension of Prolog with hypothetical implications. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level logic approach to reasoning about computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3743300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new constructive logic: classic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A system of interaction and structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing type theory in higher order constraint logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundation of logic programming based on inductive definition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof-Theoretic Approach to Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: From operational semantics to abstract machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On goal-directed provability in classical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concerning formulas of the types <i>A→B</i> ν <i>C,A →(Ex)B(x)</i> in intuitionistic formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof theory for model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completeness of the first-order functional calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming in a fragment of intuitionistic linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving and applying program transformations expressed with second-order patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unification algorithm for typed \(\overline\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponentials in non-commutative linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets, Horn programs, linear logic and vector games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm = logic + control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematics of Sentence Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focusing and Polarization in Intuitionistic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focusing and polarization in linear, intuitionistic, and classical logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kripke semantics for higher-order type theory applied to constraint logic programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making prolog more expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial evaluation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5600875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clausal intuitionistic logic I. fixed-point semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clausal intuitionistic logic II. tableau proof procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-elimination for a logic with definitions and induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical analysis of modules in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification under a mixed prefix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forum: A multiple-conclusion specification logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encryption as an abstract data-type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing and Reasoning with Operational Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof checking and logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanized metatheory revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with Higher-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform proofs as a foundation for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof theory for generic judgments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixpoint semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kripke-style models for typed lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof procedure for the logic of hereditary Harrop formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform provability in classical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondences between classical, intuitionistic and uniform provability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A treatment of higher-order features in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order Horn clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subexponentials, focusing and modalities in concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specifying Proof Systems in Linear Logic with Subexponentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential concurrent constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IeanCOP: lean connection-based theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: The foundation of a generic theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of logic programs: Foundations and techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4812964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal logic, a first order theory of names and binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural approach to operational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Proof-theoretic Investigation of Linear Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order Answer Set Programming as Constructive Proof Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Logical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the Curry-Howard isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic propositional logic is polynomial-space complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Prolog technology theorem prover: Implementation by an extended Prolog compiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of cut-elimination theorem in simple type-theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5822069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn clause computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-value is dual to call-by-name / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down and Bottom-up Evaluation Procedurally Integrated / rank
 
Normal rank
Property / cites work
 
Property / cites work: SWI-Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated theorem proving and logic programming: a natural symbiosis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639372 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:07, 21 August 2024

scientific article; zbMATH DE number 7776351
Language Label Description Also known as
English
A Survey of the Proof-Theoretic Foundations of Logic Programming
scientific article; zbMATH DE number 7776351

    Statements

    A Survey of the Proof-Theoretic Foundations of Logic Programming (English)
    0 references
    12 December 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers