David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules that look like Prolog rules, but the computational mechanisms used in ASP are different: they are based on the ideas that have led to the creation of fast satisfiability solvers for propositional logic.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Carlos Viegas Damásio & Luís Moniz Pereira (2002). Hybrid Probabilistic Logic Programs as Residuated Logic Programs. Studia Logica 72 (1):113 - 138.
David Pearce & Agustín Valverde (2005). A First Order Nonmonotonic Extension of Constructive Logic. Studia Logica 80 (2-3):321 - 346.
Jean-Gabriel Ganascia (2007). Modelling Ethical Rules of Lying with Answer Set Programming. Ethics and Information Technology 9 (1):39-47.
Uwe Egly, Sarah Alice Gaggl & Stefan Woltran (2011). Answer-Set Programming Encodings for Argumentation Frameworks. Argument and Computation 1 (2):147-177.
Added to index2009-01-28
Total downloads5 ( #230,195 of 1,103,009 )
Recent downloads (6 months)1 ( #297,567 of 1,103,009 )
How can I increase my downloads?