Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Gringo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Terminyzer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2629337 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108205915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query-Driven Procedures for Hybrid MKNF Knowledge Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive ASP with functions: Decidable queries and effective computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidable subclass of finitary programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finitely recursive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Functions in ASP: Theory and Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabled evaluation with delaying for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of logic programs: the never-ending story / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data exchange: semantics and query answering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Termination of Logic Programs with Function Symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical analysis of non-termination in large logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One More Decidable Class of Finitely Ground Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination Analysis of Logic Programs Based on Dependency Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of narrowing via termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of terminating logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient access mechanisms for tabled logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated termination proofs for logic programs by term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of termination conditions for numerical loops in Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of floating-point computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: XSB: Extending Prolog with Tabled Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3746920 / 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: Termination proofs for logic programs with tabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-termination analysis of logic programs with integer arithmetics / rank
 
Normal rank

Latest revision as of 18:31, 10 July 2024

scientific article
Language Label Description Also known as
English
Terminating Evaluation of Logic Programs with Finite Three-Valued Models
scientific article

    Statements

    Terminating Evaluation of Logic Programs with Finite Three-Valued Models (English)
    0 references
    0 references
    0 references
    17 September 2015
    0 references
    tabled logic programming
    0 references
    termination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers