Pubbl/distr/stampa	Piscataway, NJ : , : IEEE, , ©2004-
Descrizione fisica	online resource
Disciplina	004.6
Soggetto topico	Computer networks Detectors Control theory Artificial intelligence Transportation Mobile communication systems
Soggetto genere / forma	Electronic journals. Conference papers and proceedings. Periodicals.
Formato	Materiale a stampa
Livello bibliografico	Periodico
Lingua di pubblicazione	eng
Altri titoli varianti	IEEE ICNSC Conference proceedings Proceedings ICNSC .. ICNSC proceedings IEEE Networking, Sensing and Control proceedings Proceedings of the ... IEEE International Conference on Networking, Sensing and Control
Record Nr.	UNISA-996280948103316

Pubbl/distr/stampa	Piscataway, NJ : , : IEEE
Disciplina	629.8
Soggetto topico	Automatic control - Data processing Automation - Data processing Computational intelligence Artificial intelligence Intelligent control systems
Soggetto genere / forma	Conference papers and proceedings.
Formato	Materiale a stampa
Livello bibliografico	Periodico
Lingua di pubblicazione	eng
Record Nr.	UNISA-996279950803316

Pubbl/distr/stampa	Mt Pleasant, MI : , : ACIS International, , 2014-
Descrizione fisica	online resource
Disciplina	005
Soggetto topico	Software engineering Artificial intelligence Wireless communication systems
Soggetto genere / forma	Conference papers and proceedings.
ISSN	2693-8421
Formato	Materiale a stampa
Livello bibliografico	Periodico
Lingua di pubblicazione	eng
Altri titoli varianti	SNPD .. Proceedings
Record Nr.	UNINA-9910626128203321

Pubbl/distr/stampa	Piscataway, NJ : , : IEEE, , [2011]-
Disciplina	004
Soggetto topico	Context-aware computing Artificial intelligence Autonomic computing
Soggetto genere / forma	Conference papers and proceedings. Periodicals.
ISSN	2325-5986
Formato	Materiale a stampa
Livello bibliografico	Periodico
Lingua di pubblicazione	eng
Altri titoli varianti	ICAST Proceedings of ... International Conference on Awareness Science and Technology
Record Nr.	UNINA-9910625168203321

Edizione	[1st ed. 1990.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990
Descrizione fisica	1 online resource (XVIII, 690 p.)
Disciplina	006.3
Collana	Lecture Notes in Artificial Intelligence
Soggetto topico	Artificial intelligence Mathematical logic Artificial Intelligence Mathematical Logic and Formal Languages
ISBN	3-540-47171-5
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	A theorem prover for a computational logic -- A complete semantic back chaining proof system -- Parallelizing the closure computation in automated deduction -- Partheo: A high-performance parallel theorem prover -- Substitution-based compilation of extended rules in deductive databases -- Automatic theorem proving in paraconsistent logics: Theory and implementation -- Case-free programs: An abstraction of definite horn programs -- Generalized well-founded semantics for logic programs -- Tactical theorem proving in program verification -- Extensions to the rippling-out tactic for guiding inductive proofs -- Guiding induction proofs -- Term rewriting induction -- A resolution principle for clauses with constraints -- Str+ve: The Str+ve-based subset prover -- Ritt-Wu's decomposition algorithm and geometry theorem proving -- Encoding a dependent-type ?-calculus in a logic programming language -- Investigations into proof-search in a system of first-order dependent function types -- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete -- An improved general E-unification method -- Some results on equational unification -- Unification in a combination of equational theories: an efficient algorithm -- SLIM: An automated reasoner for equivalences, applied to set theory -- An examination of the prolog technology theorem-prover -- Presenting intuitive deductions via symmetric simplification -- Toward mechanical methods for streamlining proofs -- Ordered rewriting and confluence -- Complete sets of reductions with constraints -- Rewrite systems for varieties of semigroups -- Improving associative path orderings -- Perspectives on automated deduction -- On restrictions of ordered paramodulation with simplification -- Simultaneous paramodulation -- Hyper resolution and equality axioms without function substitutions -- Automatic acquisition of search guiding heuristics -- Automated reasoning contributes to mathematics and logic -- A mechanically assisted constructive proof in category theory -- Dynamic logic as a uniform framework for theorem proving in intensional logic -- A tableaux-based theorem prover for a decidable subset of default logic -- Computing prime implicants -- Minimizing the number of clauses by renaming -- Higher order E-unification -- Programming by example and proving by example using higher-order unification -- Retrieving library identifiers via equational matching of types -- Unification in monoidal theories -- A science of reasoning: Extended abstract -- The TPS theorem proving system -- Schemata -- Cylindric algebra equation solver -- The OYSTER-CLAM system -- A high-performance parallel theorem prover -- The romulus proof checker -- IMPS : An interactive mathematical proof system -- UNICOM: A refined completion based inductive theorem prover -- The theorem prover of the program verifier Tatzelwurm -- RCL: A lisp verification system -- Orme an implementation of completion procedures as sets of transitions rules -- Otter 2.0 -- Dissolver: A dissolution-based theorem prover -- TRIP: An implementation of clausal rewriting -- OSCAR -- Expert thinker: An adaptation of F-Prolog to microcomputers -- A prolog technology theorem prover -- A general clause theorem prover -- Liss — The logic inference search system -- ACE: The abstract clause engine -- Tutorial on high-performance automated theorem proving -- Tutorial on reasoning and representation with concept languages -- Tutorial on ?Prolog -- Tutorial on equational unification -- Tutorial on compilation techniques for logics -- Tutorial on high-performance theorem provers: Efficient implementation and parallelisation -- Tutorial on rewrite-based theorem proving -- Tutorial on program-synthetic deduction -- Tutorial on computing models of propositional logics.
Record Nr.	UNISA-996465843003316