000 04381nam a22005775i 4500
001 978-3-540-72200-7
003 DE-He213
005 20240730185235.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540722007
_9978-3-540-72200-7
024 7 _a10.1007/978-3-540-72200-7
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aLogic Programming and Nonmonotonic Reasoning
_h[electronic resource] :
_b9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings /
_cedited by Chitta Baral, Gerhard Brewka, John Schlipf.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aIX, 327 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v4483
505 0 _aInvited 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: Representaton, Disjunction 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.
650 0 _aSoftware engineering.
_94138
650 0 _aArtificial intelligence.
_93407
650 0 _aMachine theory.
_9138480
650 0 _aComputer programming.
_94169
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aFormal Languages and Automata Theory.
_9138481
650 2 4 _aProgramming Techniques.
_9138482
700 1 _aBaral, Chitta.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9138483
700 1 _aBrewka, Gerhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9138484
700 1 _aSchlipf, John.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9138485
710 2 _aSpringerLink (Online service)
_9138486
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540721994
776 0 8 _iPrinted edition:
_z9783540837817
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v4483
_9138487
856 4 0 _uhttps://doi.org/10.1007/978-3-540-72200-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92720
_d92720