8094 search results - page 47 / 1619 » Improvements in Formula Generalization |
JAIR
2012
11 years 10 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
RAM
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
FMCAD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
TRS
2008
13 years 7 months ago
2008
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...