Look-back Techniques for ASP Programs with Aggregates Wolfgang Faber1 , Nicola Leone1 , Marco Maratea1,2 , and Francesco Ricca1 1 Department of Mathematics, University of Calabria, 87036 Rende (CS), Italy

First Page		Document Content
Date: 2008-11-30 17:58:06 Logic Mathematics Mathematical logic Logic programming Model theory Stable model semantics Modal logic Substitution FO Binomial coefficient		Look-back Techniques for ASP Programs with Aggregates Wolfgang Faber1 , Nicola Leone1 , Marco Maratea1,2 , and Francesco Ricca1 1 Department of Mathematics, University of Calabria, 87036 Rende (CS), Italy Add to Reading List Source URL: ceur-ws.org Download Document from Source Website File Size: 150,69 KB Share Document on Facebook

	A Relational Modal Logic for Higher-Order Stateful ADTs (Technical Appendix) Derek Dreyer Georg Neis DocID: 1vj1H - View Document
	1 2 Avicenna sets up a modal logic with a Kripke semantics DocID: 1uVyg - View Document
	100 Book Reviews This much carries over to Hale’s possibility semantics. Hale’s metaphysics motivates adopting a hybrid modal logic. Where n is a DocID: 1uUMQ - View Document
	Modal Logic and Invariance Johan van Benthem Denis Bonnay Abstract DocID: 1uOtj - View Document
	Non-Well-Founded Proofs for Modal Grzegorczyk Logic Yury Savateev 1 DocID: 1uJwG - View Document