Arguing correctness of ASP programs with aggregates (Q2694567): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/978-3-031-15707-3_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4293179575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Tuning in Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Answer Set Programming as a Formal Specification Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Tight Logic Programs with anthem and vampire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable models and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract gringo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programs with stable model semantics as a constraint programming paradigm / rank
 
Normal rank

Latest revision as of 20:19, 31 July 2024

scientific article
Language Label Description Also known as
English
Arguing correctness of ASP programs with aggregates
scientific article

    Statements

    Arguing correctness of ASP programs with aggregates (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2023
    0 references
    ASP
    0 references
    program verification
    0 references
    aggregate semantics
    0 references
    modular proofs of correctness
    0 references

    Identifiers