Towards a Type Discipline for Answer Set Programming

DOI10.1007/978-3-642-02444-3_8zbMath1246.68080OpenAlexW1866350436MaRDI QIDQ3638249

Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02444-3_8

zbMATH Keywords

answer set programminggroundingtype checkingmany sorted interpretation

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• DLV-Complex
• Smodels
• DLV-EX
• Ciao
• CiaoPP
• OntoDLV

Cites Work

• Unnamed Item
• Unnamed Item
• Polymorphic type inference for the relational algebra
• A polymorphic type system for Prolog
• Horn clause programs with polymorphic types: Semantics and resolution
• Extending and implementing the stable model semantics
• External sources of knowledge and value invention in logic programming
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• OntoDLV: An ASP-based System for Enterprise Ontologies
• Knowledge Representation, Reasoning and Declarative Problem Solving
• The DLV system for knowledge representation and reasoning
• Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages
• Logic Programming
• Computable Functions in ASP: Theory and Implementation

This page was built for publication: Towards a Type Discipline for Answer Set Programming