254 search results - page 17 / 51 » Answer Sets for Propositional Theories |
KR
1992
Springer
14 years 1 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
MFCS
1990
Springer
14 years 1 months ago
1990
Springer
The plausibility of computing the answers to many membership queries to a hard set with few queries is the subject of the theory of terseness. In this paper, we develop companion ...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proof-irrelevanc...
JAIR
2006
13 years 9 months ago
2006
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
LPNMR
2009
Springer
14 years 3 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...