27 search results - page 3 / 6 » Decidability of Propositionally Quantified Logics of Knowled... |
KR
2004
Springer
15 years 5 months ago
2004
Springer
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
116
Voted
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...
100
click to vote
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
BIRTHDAY
2010
Springer
15 years 25 days ago
2010
Springer
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
CORR
2004
Springer
14 years 11 months ago
2004
Springer
We have previously introduced role logic as a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of ro...