Gerhard Brewka, Jérôme Lang
Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning
KR, 2008.

@proceedings{KR-2008,
	address       = "Sydney, Australia",
	editor        = "Gerhard Brewka and Jérôme Lang",
	isbn          = "978-1-57735-384-3",
	publisher     = "{AAAI Press}",
	title         = "{Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning}",
	year          = 2008,
}

Contents (71 items)

15 ×#logic
6 ×#reasoning
5 ×#ontology
5 ×#query
4 ×#on the
4 ×#set
3 ×#calculus
3 ×#complexity
3 ×#composition
3 ×#consistency

KR-2008-Brafman

Preferences, Planning and Control (RIB), pp. 2–5.

KR-2008-Halpern #concept #equilibrium #nash

Beyond Nash Equilibrium: Solution Concepts for the 21st Century (JYH), pp. 6–15.

KR-2008-AlechinaDLM #reasoning

Reasoning about Agent Deliberation (NA, MD, BL, JJCM), pp. 16–26.

KR-2008-CasaliGS #framework #logic

A Logical Framework to Represent and Reason about Graded Preferences and Intentions (AC, LG, CS), pp. 27–37.

KR-2008-LoriniL #logic

A Logical Account of Institutions: From Acceptances to Norms via Legislators (EL, DL), pp. 38–48.

KR-2008-RamanujamS #game studies #logic

Dynamic Logic on Games with Structured Strategies (RR, SES), pp. 49–58.

KR-2008-SimariBSK #axiom

Promises Kept, Promises Broken: An Axiomatic and Quantitative Treatment of Fulfillment (GIS, MB, VSS, SK), pp. 59–69.

KR-2008-CaliGK #constraints #infinity #query #relational

Taming the Infinite Chase: Query Answering under Expressive Relational Constraints (AC, GG, MK), pp. 70–80.

KR-2008-Cortes-CalabuigDAB #approximate #database #fixpoint #performance #query

Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases (ACC, MD, OA, MB), pp. 81–91.

KR-2008-HinrichsG #finite #how #injection #logic #what

Injecting the How into the What: Investigating a Finite Classical Logic (TLH, MRG), pp. 92–192.

KR-2008-WittocxMD #approximate #first-order #logic #reasoning

Approximate Reasoning in First-Order Logic Theories (JW, MM, MD), pp. 103–112.

KR-2008-AmgoudDM

Making Decisions through Preference-Based Argumentation (LA, YD, PM), pp. 113–123.

KR-2008-CayrolSL

Revision of an Argumentation System (CC, FDdSC, MCLS), pp. 124–134.

KR-2008-MartinezGS #framework

An Abstract Argumentation Framework with Varied-Strength Attacks (DCM, AJG, GRS), pp. 135–144.

KR-2008-BoothM #social

Equilibria in Social Belief Removal (RB, TAM), pp. 145–155.

KR-2008-Delgrande #horn clause

Horn Clause Belief Change: Contraction Functions (JPD), pp. 156–165.

KR-2008-Kern-Isberner #reasoning

Linking Iterated Belief Change Operations to Nonmonotonic Reasoning (GKI), pp. 166–176.

KR-2008-KoniecznyP

Improvement Operators (SK, RPP), pp. 177–187.

KR-2008-Saint-Cyr #reasoning

Scenario Update Applied to Causal Reasoning (FDdSC), pp. 188–197.

KR-2008-Halpern08a

Defaults and Normality in Causal Structures (JYH), pp. 198–208.

KR-2008-Meyden #distributed #on the

On Notions of Causality and Distributed Knowledge (RvdM), pp. 209–219.

KR-2008-Bienvenu #abduction #complexity #lightweight #logic #product line

Complexity of Abduction in the EL Family of Lightweight Description Logics (MB), pp. 220–230.

KR-2008-CalvaneseGLLR #constraints #identification #logic

Path-Based Identification Constraints in Description Logics (DC, GDG, DL, ML, RR), pp. 231–241.

KR-2008-CalvaneseGLR #logic #ontology #query

View-Based Query Answering over Description Logic Ontologies (DC, GDG, ML, RR), pp. 242–251.

KR-2008-GlimmHS #query

Unions of Conjunctive Queries in SHOQ (BG, IH, US), pp. 252–262.

KR-2008-HahmannG #ontology

Model-Theoretic Characterization of Asher and Vieu’s Ontology of Mereotopology (TH, MG), pp. 263–273.

KR-2008-Kazakov

RIQ and SROIQ Are Harder than SHOIQ (YK), pp. 274–284.

KR-2008-KontchakovWZ #difference #ontology #question

Can You Tell the Difference Between DL-Lite Ontologies? (RK, FW, MZ), pp. 285–295.

KR-2008-MotikGHS #graph #representation #using

Representing Structured Objects using Description Graphs (BM, BCG, IH, US), pp. 296–306.

KR-2008-SchroderP #how #logic #strict

How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics (LS, DP), pp. 307–317.

KR-2008-TunD #generative #ontology #reuse

Ontology Generation through the Fusion of Partial Reuse and Relation Extraction (NNT, JSD), pp. 318–328.

KR-2008-BinasM #consistency #peer-to-peer #query

Peer-to-Peer Query Answering with Inconsistent Knowledge (AB, SAM), pp. 329–339.

KR-2008-Chetcuti-SperandioL #how #logic #strict

How to Choose Weightings to Avoid Collisions in a Restricted Penalty Logic (NCS, SL), pp. 340–347.

KR-2008-EveraereKM

Conflict-Based Merging Operators (PE, SK, PM), pp. 348–357.

KR-2008-HunterK #consistency #nondeterminism #set

Measuring Inconsistency through Minimal Inconsistent Sets (AH, SK), pp. 358–366.

KR-2008-MartinezPPSS #consistency #nondeterminism #policy

Inconsistency Management Policies (MVM, FP, AP, GIS, VSS), pp. 367–377.

KR-2008-MichaelV

A First Experimental Demonstration of Massive Knowledge Infusion (LM, LGV), pp. 378–389.

KR-2008-AnalytiAD #composition #framework #semantics #web

A Principled Framework for Modular Web Rule Bases and Its Semantics (AA, GA, CVD), pp. 390–400.

KR-2008-ChenJL

Computing Loops with at Most One External Support Rule (XC, JJ, FL), pp. 401–410.

KR-2008-DelgrandeSTW #logic programming #semantics #set #source code

Belief Revision of Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 411–421.

KR-2008-DrescherGGKKOS #set

Conflict-Driven Disjunctive Answer Set Solving (CD, MG, TG, BK, AK, MO, TS), pp. 422–432.

KR-2008-FaberTW #equivalence #logic programming #order #source code

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.

KR-2008-LeeM #on the

On Loop Formulas with Variables (JL, YM), pp. 444–453.

KR-2008-LinW #programming #set

Answer Set Programming with Functions (FL, YW), pp. 454–465.

KR-2008-Bochman

Default Theory of Defeasible Entailment (AB), pp. 466–475.

KR-2008-BritzHM #semantics

Semantic Preferential Subsumption (KB, JH, TAM), pp. 476–484.

KR-2008-BruijnET #logic #ontology

Embedding Approaches to Combining Rules and Ontologies into Autoepistemic Logic (JdB, TE, HT), pp. 485–495.

KR-2008-LianW #reduction

Computing Default Extensions by Reductions on OR (EHL, AW), pp. 496–506.

KR-2008-YahiBLSP

A Lexicographic Inference for Partially Preordered Belief Bases (SY, SB, SL, MS, OP), pp. 507–517.

KR-2008-EyerichBN #complexity #on the

On the Complexity of Planning Operator Subsumption (PE, MB, BN), pp. 518–527.

KR-2008-MagnussonD #deduction #induction

Deductive Planning with Inductive Loops (MM, PD), pp. 528–534.

KR-2008-Rintanen #graph

Planning Graphs and Propositional Clause-Learning (JR), pp. 535–543.

KR-2008-RogerHN #on the

On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle (GR, MH, BN), pp. 544–550.

KR-2008-Brafman08a #relational

Relational Preference Rules for Control (RIB), pp. 552–559.

KR-2008-DohertyS #reasoning #using

Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription (PD, AS), pp. 560–570.

KR-2008-PiniRVW #nondeterminism

Dealing with Incomplete Agents’ Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority Voting (MSP, FR, KBV, TW), pp. 571–578.

KR-2008-UckelmanE #modelling

Preference Modeling by Weighted Goals with Max Aggregation (JU, UE), pp. 579–588.

KR-2008-ClassenL #logic #source code

A Logic for Non-Terminating Golog Programs (JC, GL), pp. 589–599.

KR-2008-FritzBM #compilation

ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond (CF, JAB, SAM), pp. 600–610.

KR-2008-KellyP #calculus

Complex Epistemic Modalities in the Situation Calculus (RFK, ARP), pp. 611–620.

KR-2008-Lin #proving

Proving Goal Achievability (FL), pp. 621–628.

KR-2008-Petrick #calculus #composition

Cartesian Situations and Knowledge Decomposition in the Situation Calculus (RPAP), pp. 629–639.

KR-2008-SardinaPG #behaviour #composition

Behavior Composition in the Presence of Failure (SS, FP, GDG), pp. 640–650.

KR-2008-Varzinczak

Action Theory Erasure and Minimal Change (IJV), pp. 651–661.

KR-2008-VassosLL #first-order

First-Order Strong Progression for Local-Effect Basic Action Theories (SV, GL, HJL), pp. 662–672.

KR-2008-ArtaleGK #constraints #formal method

Formalising Temporal Constraints on Part-Whole Relations (AA, NG, CMK), pp. 673–683.

KR-2008-BaaderGL #axiom #logic #ltl

LTL over Description Logic Axioms (FB, SG, CL), pp. 684–694.

KR-2008-Balbiani #analysis #reasoning #representation #standard

Time Representation and Temporal Reasoning from the Perspective of Non-Standard Analysis (PB), pp. 695–704.

KR-2008-BelardinelliL #first-order #logic

A Complete First-Order Logic of Knowledge and Time (FB, AL), pp. 705–714.

KR-2008-RenzL #automation #calculus #complexity #proving

Automated Complexity Proofs for Qualitative Spatial and Temporal Calculi (JR, JJL), pp. 715–723.

KR-2008-TomanW #identification #logic

Identifying Objects Over Time with Description Logics (DT, GEW), pp. 724–732.