5506 search results - page 98 / 1102 » Minimal Logic Programs |
93
Voted
ICES
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We present a systematic procedure for the synthesis and minimisation of digital circuits using propositional satisfiability. We encode the truth table into a canonical s...
127
click to vote
ASP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...
116
Voted
ECSQARU
2005
Springer
15 years 6 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...
110
click to vote
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
88
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2log1−ǫ (n) -inapproximability re...