Logic Programming and Nonmonotonic Reasoning 8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Baral, Chitta (Επιμελητής έκδοσης), Greco, Gianluigi (Επιμελητής έκδοσης), Leone, Nicola (Επιμελητής έκδοσης), Terracina, Giorgio (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Lecture Notes in Computer Science, 3662
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04939nam a22005895i 4500
001 978-3-540-31827-9
003 DE-He213
005 20151204160835.0
007 cr nn 008mamaa
008 100315s2005 gw | s |||| 0|eng d
020 |a 9783540318279  |9 978-3-540-31827-9 
024 7 |a 10.1007/11546207  |2 doi 
040 |d GrThAP 
050 4 |a Q334-342 
050 4 |a TJ210.2-211.495 
072 7 |a UYQ  |2 bicssc 
072 7 |a TJFM1  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
245 1 0 |a Logic Programming and Nonmonotonic Reasoning  |h [electronic resource] :  |b 8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005. Proceedings /  |c edited by Chitta Baral, Gianluigi Greco, Nicola Leone, Giorgio Terracina. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2005. 
300 |a XIV, 462 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 Computer Science,  |x 0302-9743 ;  |v 3662 
505 0 |a Invited Papers -- Nonmonotonic Reasoning in FLORA-2 -- Data Integration and Answer Set Programming -- Halo I: A Controlled Experiment for Large Scale Knowledge Base Development -- ASP Foundations -- Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates -- Loops: Relevant or Redundant? -- Approximating Answer Sets of Unitary Lifschitz-Woo Programs -- On Modular Translations and Strong Equivalence -- ASP Extensions -- Guarded Open Answer Set Programming -- External Sources of Computation for Answer Set Solvers -- Answer Sets for Propositional Theories -- Applications -- An ID-Logic Formalization of the Composition of Autonomous Databases -- On the Local Closed-World Assumption of Data-Sources -- Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming -- Actions and Causations -- An Approximation of Action Theories of and Its Application to Conformant Planning -- Game-Theoretic Reasoning About Actions in Nonmonotonic Causal Theories -- Some Logical Properties of Nonmonotonic Causal Theories -- odular-?: An Elaboration Tolerant Approach to the Ramification and Qualification Problems -- Algorithms and Computation -- Platypus: A Platform for Distributed Answer Set Solving -- Solving Hard ASP Programs Efficiently -- Mode-Directed Fixed Point Computation -- Lookahead in Smodels Compared to Local Consistencies in CSP -- Foundations -- Nested Epistemic Logic Programs -- An Algebraic Account of Modularity in ID-Logic -- Default Reasoning with Preference Within Only Knowing Logic -- Semantics -- A Social Semantics for Multi-agent Systems -- Revisiting the Semantics of Interval Probabilistic Logic Programs -- Routley Semantics for Answer Sets -- The Well Supported Semantics for Multidimensional Dynamic Logic Programs -- Application Track -- Application of Smodels in Quartet Based Phylogeny Construction -- Using Answer Set Programming for a Decision Support System -- Data Integration: a Challenging ASP Application -- Abduction and Preferences in Linguistics -- Inference of Gene Relations from Microarray Data by Abduction -- System Track -- nomore: A System for Computing Preferred Answer Sets -- Integrating an Answer Set Solver into Prolog: - -- circ2dlp — Translating Circumscription into Disjunctive Logic Programming -- Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers -- KMonitor– A Tool for Monitoring Plan Execution in Action Theories -- The nomore++ System -- Smodels A — A System for Computing Answer Sets of Logic Programs with Aggregates -- A DLP System with Object-Oriented Features -- Testing Strong Equivalence of Datalog Programs – Implementation and Examples -- SELP – A System for Studying Strong Equivalence Between Logic Programs -- cmodels – SAT-Based Disjunctive Answer Set Solver. 
650 0 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Software engineering. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Software Engineering. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Programming Techniques. 
700 1 |a Baral, Chitta.  |e editor. 
700 1 |a Greco, Gianluigi.  |e editor. 
700 1 |a Leone, Nicola.  |e editor. 
700 1 |a Terracina, Giorgio.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540285380 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3662 
856 4 0 |u http://dx.doi.org/10.1007/11546207  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)