1999/08/06 by Patrik Simons, Simons, Patrik
Computer Science · #Artificial Intelligence (cs.AI) #F.4.1 #FOS: Computer and information sciences #I.2.3 #I.2.8 #Logic in Computer Science (cs.LO) #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/9908004
18 pages, a shortened version will be published in the proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99)
arxiv created 1999/08/06 · arxiv updated 2009/11/30
The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together with a decision procedure that has been used as a base for an efficient implementation, the new rules supplant the standard ones in practical applications of the stable model semantics.