2013/01/07 by Joohyung Lee, Yunsong Meng, Lee, Joohyung +1
Computer Science · #Advanced Algebra and Logic #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.AI #cs.LO
paper · pdf · doi:10.48550/arxiv.1301.1393
Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary
arxiv created 2013/01/08 · openalex publication_date 2013/01/08 · arxiv updated 2013/01/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present alternative definitions of the first-order stable model semantics and its extension to incorporate generalized quantifiers by referring to the familiar notion of a reduct instead of referring to the SM operator in the original definitions. Also, we extend the FLP stable model semantics to allow generalized quantifiers by referring to an operator that is similar to the \sm operator. For a reasonable syntactic class of logic programs, we show that the two stable model semantics of generalized quantifiers are interchangeable.