|Abstract||Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence can be characterized by a formula of a simple syntactic form.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Timothy Bays (2001). Partitioning Subsets of Stable Models. Journal of Symbolic Logic 66 (4):1899-1908.
Johan Van Benthem (1998). Program Constructions That Are Safe for Bisimulation. Studia Logica 60 (2):311-330.
Johan Van Benthem (1998). Program Constructions That Are Safe for Bisimulation. Studia Logica 60 (2):311 - 330.
Sven Ove Hansson (2006). Safe Design. Techné 10 (1):45-52.
José Iovino (1999). Stable Models and Reflexive Banach Spaces. Journal of Symbolic Logic 64 (4):1595-1600.
Alexandru Baltag & Sonja Smets (2008). Probabilistic Dynamic Belief Revision. Synthese 165 (2):179 - 202.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,386 of 722,826 )
Recent downloads (6 months)0
How can I increase my downloads?