| 000 | 05033nam a22003495i 4500 | ||
|---|---|---|---|
| 001 | 318416 | ||
| 003 | MX-SnUAN | ||
| 005 | 20160429161132.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 160111s2014 gw | s |||| 0|eng d | ||
| 020 |
_a9783319115580 _9978-3-319-11558-0 |
||
| 035 | _avtls000418863 | ||
| 039 | 9 |
_y201601110908 _zstaff |
|
| 050 | 4 | _aQ334-342 | |
| 245 | 1 | 0 |
_aLogics in artificial intelligence : _b14th european conference, jelia 2014, funchal, madeira, portugal, september 24-26, 2014. Proceedings / _cedited by Eduardo Fermé, João Leite. |
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bSpringer, _c2014. |
|
| 300 |
_axvi, 704 páginas : _b88 ilustraciones |
||
| 336 |
_atexto _btxt _2rdacontent |
||
| 337 |
_acomputadora _bc _2rdamedia |
||
| 338 |
_arecurso en línea _bcr _2rdacarrier |
||
| 347 |
_aarchivo de texto _bPDF _2rda |
||
| 490 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8761 |
|
| 500 | _aSpringer eBooks | ||
| 505 | 0 | _aQuery Answering over Description Logic Ontologies -- Tools for the Investigation of Substructural and Paraconsistent Logics -- Non-classical Planning with a Classical Planner: The Power of Transformations -- Opportunities for Argument-Centric Persuasion in Behaviour Change -- The Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics -- Tight Complexity Bounds for Reasoning in the Description Logic BEL -- Relevant Closure: A New Form of Defeasible Reasoning for Description Logics -- Error-Tolerant Reasoning in the Description Logic EL -- Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations -- SAT Modulo Graphs: Acyclicity -- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form -- Improving the Normalization of Weight Rules in Answer Set Programs -- Logical Foundations of Possibilistic Keys -- Possibilistic Boolean Games: Strategic Reasoning under Incomplete Information -- LEG Networks for Ranking Functions -- Logics for Approximating Implication Problems of Saturated Conditional Independence -- Non-Classical Logics Finitary S5-Theories -- Efficient Program Transformers for Translating LCC to PDL -- On the Expressiveness of the Interval Logic of Allen’s Relations over Finite and Discrete Linear Orders -- Only-Knowing a la Halpern-Moses for Non-omniscient Rational Agents: A Preliminary Report -- Answer-Set Programming A Complexity Assessment for Queries Involving Sufficient and Necessary Causes -- Inductive Learning of Answer Set Programs -- Stable Models of Fuzzy Propositional Formulas -- A Free Logic for Stable Models with Partial Intensional Functions -- Constructive Models for Contraction with Intransitive Plausibility Indifference -- Four Floors for the Theory of Theory Change: The Case of Imperfect Discrimination -- Revisiting Postulates for Inconsistency Measures -- A Translation-Based Approach for Revision of Argumentation Frameworks -- Dealing with Inconsistency in ASP and DL Preserving Strong Equivalence while Forgetting -- Computing Repairs for Inconsistent DL-programs over EL Ontologies -- A Prioritized Assertional-Based Revision for DL-Lite Knowledge Bases -- Modular Paracoherent Answer Sets -- Action Theories over Generalized Databases with Equality Constraints -- A Dynamic View of Active Integrity Constraints -- Similarity Orders from Causal Equations -- Verification of Context-Sensitive Knowledge and Action Bases -- System Descriptions System aspmt2smt: Computing ASPMT Theories by SMT Solvers -- A Library of Anti-unification Algorithms -- The D-FLAT System for Dynamic Programming on Tree Decompositions -- ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance -- Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search -- Short Papers -- Probabilistic Abstract Dialectical Frameworks -- Argumentative Aggregation of Individual Opinions -- Measuring Dissimilarity between Judgment Sets -- Exploiting Answer Set Programming for Handling Information Diffusion in a Multi-Social-Network Scenario -- Reasoning about Dynamic Normative Systems -- A Modal Logic of Knowledge, Belief, and Estimation -- A Logic for Belief Contraction -- Logic Foundations of the OCL Modelling Language -- Constraint-Based Algorithm for Computing Temporal Invariants -- Answer Set Solver Backdoors -- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem -- Revisiting Reductants in the Multi-adjoint Logic Programming Framework. | |
| 590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
| 700 | 1 |
_aFermé, Eduardo, _eeditor. _9362296 |
|
| 700 | 1 |
_aLeite, João, _eeditor. _9328010 |
|
| 710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
| 776 | 0 | 8 |
_iEdición impresa: _z9783319115573 |
| 856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-319-11558-0 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
| 942 | _c14 | ||
| 999 |
_c318416 _d318416 |
||