KR 2010 - PDF Preprint Papers

KR 2010 International Conference on Principles and Knowledge Representation and Reasoning

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed KR-2010 Paper

click to vote

KR
2010
Springer

360views Automated Reasoning» more KR 2010»

Preferential Semantics for Plausible Subsumption in Possibility Theory

14 years 5 months ago

Download cse.seu.edu.cn

Handling exceptions in a knowledge-based system has been considered as an important issue in many domains of applications, such as medical domain. In this paper, we propose severa...

Guilin Qi, Zhizheng Zhang

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	360	Preferential Semantics for Plausible Subsumption in Possibility Theory	claim
2	326	A Characterization of Optimality Criteria for Decision Making under Complete Ignorance	claim
3	316	A Logical Understanding of Legal Interpretation	claim
4	280	Improving Query Answering over DL-Lite Ontologies	claim
5	273	The Combined Approach to Query Answering in DL-Lite	claim
6	271	Status QIO: Conjunctive Query Entailment Is Decidable	claim
7	269	Efficient Dominance Testing for Unconditional Preferences	claim
8	269	Independence and Functional Dependence Relations on Secrets	claim
9	267	A Decidable Class of Groundable Formulas in the General Theory of Stable Models	claim
10	263	I Don't Want to Think About it Now: Decision Theory with Costly Computation	claim
11	262	Decomposing Description Logic Ontologies	claim
12	262	From Preference Logics to Preference Languages, and Back	claim
13	261	Taxonomy of Improvement Operators and the Problem of Minimal Change	claim
14	261	Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming	claim
15	257	Abstract Dialectical Frameworks	claim
16	252	The Temporal Logic of Token Causes	claim
17	249	New Advances in Sequential Diagnosis	claim
18	248	Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough	claim
19	245	Characterizing Updates in Dynamic Epistemic Logic	claim
20	244	Probabilistic Description Logics for Subjective Uncertainty	claim
21	242	Query and Predicate Emptiness in Description Logics	claim
22	241	Integrating Action Calculi and AgentSpeak: Closing the Gap	claim
23	240	Situation Calculus Based Programs for Representing and Reasoning about Game Structures	claim
24	237	Modelling Combinatorial Auctions in Linear Logic	claim
25	237	A Correctness Result for Reasoning about One-Dimensional Planning Problems	claim
26	236	Interpreting Topological Logics over Euclidean Spaces	claim
27	235	Towards Fixed-Parameter Tractable Algorithms for Argumentation	claim
28	234	Interactions between Time and Knowledge in a First-order Logic for Multi-Agent Systems	claim
29	232	Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2	claim
30	230	On the Complexity of Axiom Pinpointing in the EL Family of Description Logics	claim
31	227	One Hundred Prisoners and a Lightbulb - Logic and Computation	claim
32	227	Set-Oriented Logical Connectives: Syntax and Semantics	claim
33	226	On the Progression Semantics and Boundedness of Answer Set Programs	claim
34	225	State Defaults and Ramifications in the Unifying Action Calculus	claim
35	223	Multi-Agent Only-Knowing Revisited	claim
36	222	Pushing the Limits of Reasoning over Ontologies with Hidden Content	claim
37	219	Finding Explanations of Inconsistency in Multi-Context Systems	claim
38	218	The Modular Structure of an Ontology: An Empirical Study	claim
39	217	Distributed Nonmonotonic Multi-Context Systems	claim
40	217	Understanding Ontological Levels	claim
41	216	Diagnosis as Planning Revisited	claim
42	210	Towards a Logic of Feature-Based Semantic Science Theories	claim
43	210	Computing Inconsistency Measurements under Multi-Valued Semantics by Partial Max-SAT Solvers	claim
44	209	Generalized Planning with Loops under Strong Fairness Constraints	claim
45	209	Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms	claim
46	208	Maximally Paraconsistent Three-Valued Logics	claim
47	206	Walking the Decidability Line for Rules with Existential Variables	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers