|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-39627-7 |
| 003 |
DE-He213 |
| 005 |
20221012202827.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540396277
|9 978-3-540-39627-7
|
| 024 |
7 |
|
|a 10.1007/11853886
|2 doi
|
| 050 |
|
4 |
|a Q334-342
|
| 050 |
|
4 |
|a TA347.A78
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 072 |
|
7 |
|a UYQ
|2 thema
|
| 082 |
0 |
4 |
|a 006.3
|2 23
|
| 245 |
1 |
0 |
|a Logics in Artificial Intelligence
|h [electronic resource] :
|b 10th European Conference, JELIA 2006, Liverpool, UK, September 13-15, 2006, Proceedings /
|c edited by Michael Fisher, Wiebe van der Hoek, Boris Konev, Alexei Lisitsa.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XII, 520 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Artificial Intelligence,
|x 2945-9141 ;
|v 4160
|
| 505 |
0 |
|
|a Invited Talks -- From Inductive Logic Programming to Relational Data Mining -- Answer Set Programming: A Declarative Approach to Solving Search Problems -- Inconsistencies in Ontologies -- Technical Papers -- On Arbitrary Selection Strategies for Basic Superposition -- An Event-Condition-Action Logic Programming Language -- Distance-Based Repairs of Databases -- Natural Deduction Calculus for Linear-Time Temporal Logic -- A STIT-Extension of ATL -- On the Logic and Computation of Partial Equilibrium Models -- Decidable Fragments of Logic Programming with Value Invention -- On the Issue of Reinstatement in Argumentation -- Comparing Action Descriptions Based on Semantic Preferences -- Modal Logics of Negotiation and Preference -- Representing Action Domains with Numeric-Valued Fluents -- Model Representation over Finite and Infinite Signatures -- Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies -- Analytic Tableau Calculi for KLM Rational Logic R -- On the Semantics of Logic Programs with Preferences -- A Modularity Approach for a Fragment of -- Whatever You Say -- Automatic Deductive Synthesis of Lisp Programs in the System ALISA -- A Fault-Tolerant Default Logic -- Reasoning About Actions Using Description Logics with General TBoxes -- Introducing Attempt in a Modal Logic of Intentional Action -- On Herbrand's Theorem for Intuitionistic Logic -- Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics -- Hierarchical Argumentation -- Anti-prenexing and Prenexing for Modal Logics -- A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic -- Fuzzy Answer Set Programming -- Reasoning About an Agent Based on Its Revision History with Missing Inputs -- Knowledge Base Revision in Description Logics -- Incomplete Knowledge in Hybrid Probabilistic Logic Programs -- A Formal Analysis of KGP Agents -- Irrelevant Updates and Nonmonotonic Assumptions -- Towards Top-k Query Answering in Description Logics: The Case of DL-Lite -- Representing Causal Information About a Probabilistic Process -- Tool Descriptions -- A Tool to Facilitate Agent Deliberation -- An Implementation of a Lightweight Argumentation Engine for Agent Applications -- A Tool for Answering Queries on Action Descriptions -- An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs -- April - An Inductive Logic Programming System -- optsat: A Tool for Solving SAT Related Optimization Problems -- Automated Reasoning About Metric and Topology -- The QBFEVAL Web Portal -- A Slicing Tool for Lazy Functional Logic Programs -- cc?: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics -- A Logic-Based Tool for Semantic Information Extraction -- tarfa: Tableaux and Resolution for Finite Abduction.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
1 |
4 |
|a Artificial Intelligence.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 700 |
1 |
|
|a Fisher, Michael.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a van der Hoek, Wiebe.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Konev, Boris.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Lisitsa, Alexei.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540828877
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540396253
|
| 830 |
|
0 |
|a Lecture Notes in Artificial Intelligence,
|x 2945-9141 ;
|v 4160
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11853886
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
