343 search results - page 44 / 69 » Complete Axiomatizations for Reasoning About Knowledge and T... |
76
Voted
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
PODC
2003
ACM
15 years 2 months ago
2003
ACM
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
101
click to vote
AIMSA
2008
Springer
14 years 11 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...