Logic Programming and Nonmonotonic Reasoning [electronic resource] : 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007. Proceedings / edited by Chitta Baral, Gerhard Brewka, John Schlipf.

Por: Baral, Chitta [editor.]Colaborador(es): Brewka, Gerhard [editor.] | Schlipf, John [editor.]Tipo de material: TextoTextoSeries Lecture Notes in Computer Science, 4483Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Descripción: IX, 327 p. Also available online. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783540722007Trabajos contenidos: SpringerLink (Online service)Tema(s): Computer science | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Mathematical Logic and Formal Languages | Programming TechniquesFormatos físicos adicionales: Sin títuloClasificación CDD: 006.3 Clasificación LoC:Q334-342TJ210.2-211.495Recursos en línea: de clik aquí para ver el libro electrónico
Contenidos:
Springer eBooks
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

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: 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.

ZDB-2-SCS

ZDB-2-LNC

No hay comentarios en este titulo.

para colocar un comentario.