Artificial Intelligence and Symbolic Mathematical Computation [[electronic resource] ] : International Conference, AISMC-3, Steyr, Austria, September, 23 - 25, 1996. Proceedings / / edited by Jaques Calmet, John A. Campbell, Jochen Pfalzgraf |
Edizione | [1st ed. 1996.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
Descrizione fisica | 1 online resource (VIII, 384 p.) |
Disciplina | 006.3/01/5113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Artificial intelligence
Computers Computer science—Mathematics Algorithms Mathematical logic Computational complexity Artificial Intelligence Theory of Computation Symbolic and Algebraic Manipulation Mathematical Logic and Formal Languages Complexity |
ISBN | 3-540-70740-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Symbolic computation and teaching -- Analytica — An experiment in combining theorem proving and symbolic computation -- Document recognition, semantics, and symbolic reasoning in reverse engineering of software -- Compromised updates in labelled databases -- An inference engine for propositional two-valued logic based on the radical membership problem -- Programming by demonstration: A machine learning approach to support skill acquision for robots -- Knowledge-based information processing in manufacturing cells — The present and the future -- Calculi for qualitative spatial reasoning -- Combining local consistency, symbolic rewriting and interval methods -- Proof transformation for non-compatible rewriting -- PATCH Graphs: An efficient data structure for completion of finitely presented groups -- Measuring the likely effectiveness of strategies -- A new approach on solving 3-satisfiability -- Geometry machines: From AI to SMC -- Interactive Theorem Proving and finite projective planes -- Towards modelling the topology of homogeneous manifolds by means of symbolic computation -- Solving geometrical constraint systems using CLP based on linear constraint solver -- Towards a sheaf semantics for cooperating agents scenarios -- Data types in subdefinite models -- On theorem-proving in Horn theories with built-in algebras -- Backward reasoning in systems with cut -- Soundness and completeness versus lifting property -- Reasoning with preorders and dynamic sorts using free variable tableaux. |
Record Nr. | UNISA-996465858403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Logics in Artificial Intelligence [[electronic resource] ] : European Workshop, JELIA '96, Evora, Portugal, September 30 - October 3, 1996, Proceedings / / edited by Jose Julio Alferes, Luis Moniz Pereira, Eva Orlowska |
Edizione | [1st ed. 1996.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
Descrizione fisica | 1 online resource (X, 426 p.) |
Disciplina | 006.3/01/5113 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Architecture, Computer Mathematical logic Artificial Intelligence Computer System Implementation Mathematical Logic and Formal Languages |
ISBN | 3-540-70643-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Hyper tableaux -- An algorithm for the retrieval of unifiers from discrimination trees -- Building proofs or counterexamples by analogy in a resolution framework -- What you always wanted to know about rigid E-unification -- Labelled proofs for quantified modal logic -- A uniform tableaux method for nonmonotonic modal logics -- Design and implementation of diagnostic strategies using modal logic -- A modal action logic based framework for organization specification and analysis -- McCarthy's idea -- Strong and explicit negation in non-monotonic reasoning and logic programming -- Only persistence makes nonmonotonicity monotonous -- Ordering-based representations of rational inference -- Semi-representability of default theories in rational default logic -- A query answering algorithm for Lukaszewicz' general open default theory -- Infinitary default logic for specification of nonmonotonic reasoning -- A system for computing constrained default logic extensions -- The Oz programming model -- An abductive framework for negation in disjunctive logic programming -- Characterizing D-WFS: Confluence and iterated GCWA -- Modules and specifications -- Logic programming with integrity constraints -- Temporal reasoning over linear discrete time -- Similarity saturation for first order linear temporal logic with UNLESS -- Carving Up space: Steps towards construction of an absolutely complete theory of spatial regions -- Informational logic for automated reasoning -- Extensions for open default theories via the domain closure assumption -- Revising and updating using a back-up semantics -- A simple signed system for paraconsistent reasoning. |
Record Nr. | UNISA-996465667803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Logics in Artificial Intelligence [[electronic resource] ] : European Workshop JELIA '94, York, UK, September 5-8, 1994. Proceedings / / edited by Craig MacNish, David Pearce, Luis M. Pereira |
Edizione | [1st ed. 1994.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
Descrizione fisica | 1 online resource (IX, 416 p.) |
Disciplina | 006.3/01/5113 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
ISBN | 3-540-48657-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | From Carnap's modal logic to autoepistemic logic -- Compactness properties of nonmonotonic inference operations -- Around a powerful property of circumscriptions -- The computational value of joint consistency -- Belief dynamics, abduction, and databases -- On the logic of theory base change -- Belief, provability, and logic programs -- Revision specifications by means of programs -- Revision of non-monotonic theories -- A complete connection calculus with rigid E-unification -- Equality and constrained resolution -- Efficient strategies for Automated reasoning in modal logics -- TAS-D++: Syntactic trees transformations for Automated Theorem Proving -- A unification of ordering refinements of resolution in classical logic -- Two logical dimensions -- Prioritized autoepistemic logic -- Adding priorities and specificity to default logic -- Viewing hypothesis theories as constrained graded theories -- Temporal theories of reasoning -- Reasoning about knowledge on computation trees -- Prepositional state event logic -- Description Logics with inverse roles, functional restrictions, and n-ary relations -- On the concept of generic object: A nonmonotonic reasoning approach and examples -- Autoepistemic logic of minimal beliefs -- How to use modalities and sorts in Prolog -- Towards resource handling in logic programming: The PPL framework and its semantics -- Extending Horn clause theories by reflection principles. |
Record Nr. | UNISA-996466097003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|