7 search results - page 1 / 2 » Monotonicity Inference for Higher-Order Formulas |
CADE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity i...
ICTAI
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper an original dynamic partition of formulae in Conjunctive Normal Form (CNF) is presented. It is based on the autarky concept first introduced by Monien and Speckenme...
ECSQARU
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
IJAR
2010
13 years 3 months ago
2010
We explore generalizations of the pari-mutuel model (PMM), a formalization of an intuitive way of assessing an upper probability from a precise one. We discuss a naive extension o...
AAAI
2007
13 years 7 months ago
2007
We present the syntax and semantics of a modular ontology language SHOIQP to support context-specific reuse of knowledge from multiple ontologies. A SHOIQP ontology consists of m...