Logic programs with propositional connectives and aggregates
نویسندگان
چکیده
منابع مشابه
Representing Propositional Logic Connectives With Modular Polynomials
This paper explores the relationship between n-valued propositional logic connectives and modular polynomials. Namely the representing of logic connectives using modular polynomials. The case for n = 2 is explored and a method is developed for finding the coefficients of the unique polynomial that represents any given binary logic connective. Examples are then given for using the modular polyno...
متن کاملNon-deterministic Connectives in Propositional Godel Logic
We define the notion of a canonical Gödel system in the framework of single-conclusion hypersequent calculi. A corresponding general (nondeterministic) Gödel valuation semantics is developed, as well as a (non-deterministic) linear intuitionistic Kripke-frames semantics. We show that every canonical Gödel system induces a class of Gödel valuations (and of Kripke frames) for which it is strongly...
متن کاملPropositional Dynamic Logic with Recursive Programs
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004). We show that the satisfiability problem for this extension remains decidable, generalising known decidability results for extensions of PDL by non-regular programs.
متن کاملOrdered Completion for Logic Programs with Aggregates
Article history: Received 7 August 2013 Received in revised form 16 March 2015 Accepted 21 March 2015 Available online 25 March 2015
متن کاملSemantics of Logic Programs with Aggregates
Aggregates are functions that take sets as arguments. Examples are the function that maps a set to the number of its elements or the function which maps a set to its minimal element. Aggregates are frequently used in relational databases and have many applications in combinatorial search problems and knowledge representation. Aggregates are of particular importance for several extensions of log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2011
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1970398.1970401