{"text_format":"5","workbook":"xls","n_sheets":1,"sheets":["report2"],"props":{"last_modified_by":"sharecat"},"not_rendered":{"external_links":1,"defined_names":1},"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":21,"n_cols":5,"rows_kept":21,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[4,2,4,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[14,2,14,3],[15,2,15,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910483572003321"]
[null,null,"Titolo",null,"Logic programming and nonmonotonic reasoning : 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, proceedings / / Chitta Baral, Gerhard Brewka, John Schlipf, editors"]
[null,null,"Pubbl/distr/stampa",null,"Berlin ; ; Heidelberg : , : Springer-Verlag, , [2007]"]
[{"$nulls":4},"©2007"]
[null,null,"ISBN",null,"1-280-94072-7"]
[{"$nulls":4},"1-280-30797-8"]
[{"$nulls":4},"9786610940721"]
[{"$nulls":4},"3-540-72200-9"]
[null,null,"Edizione",null,"[1st ed. 2007.]"]
[null,null,"Descrizione fisica",null,"1 online resource (335 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science ; ; 4483"]
[null,null,"Disciplina",null,"005.115"]
[null,null,"Soggetti",null,"Logic programming"]
[{"$nulls":4},"Nonmonotonic reasoning"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[{"$nulls":3},"Livello bibliografico","Monografia"]
[{"$nulls":3},"Note generali","International conference proceedings."]
[{"$nulls":3},"Nota di bibliografia","Includes bibliographical references and author index."]
[null,null,"Nota di contenuto",null,"Invited Talks/Competition -- Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications -- Policy-Based Computing: From Systems and Applications to Theory -- The First Answer Set Programming System Competition -- Technical Papers -- cr-models: An Inference Engine for CR-Prolog -- Debugging ASP Programs by Means of ASP -- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation -- Complexity of Default Logic on Generalized Conjunctive Queries -- A Preference-Based Framework for Updating Logic Programs -- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions -- On the Complexity of Answer Set Programming with Aggregates -- Experimenting with Look-Back Heuristics for Hard ASP Programs -- Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains -- Conflict-Driven Answer Set Enumeration -- Head-Elementary-Set-Free Logic Programs -- A Deductive System for PC(ID) -- Modularity Aspects of Disjunctive Stable Models -- A Characterization of Strong Equivalence for Logic Programs with Variables -- A Unified Semantics for Constraint Handling Rules in Transaction Logic -- Conditional Planning with External Functions -- Logic Programs with Abstract Constraints: Representation, Disjunction "]
[{"$nulls":4},"and Complexities -- General Default Logic -- System Descriptions -- The System: Logic Programming Meets Outlier Detection -- clasp: A Conflict-Driven Answer Set Solver -- GrinGo: A New Grounder for Answer Set Programming -- Using Answer Sets to Solve Belief Change Problems -- An Smodels System with Limited Lookahead Computation -- Programming Applications in CIFF -- CPP: A Constraint Logic Programming Based Planner with Preferences -- Posters -- An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment -- On the Effectiveness of Looking Ahead in Search for Answer Sets -- Enhancing ASP Systems for Planning with Temporal Constraints -- Semantics for Possibilistic Disjunctive Programs -- Modularity in smodels Programs."]