Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("GOTTLOB, G")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 32

  • Page / 2
Export

Selection :

  • and

SEMANTIC REPRESENTATION OF LOGICAL OPERATORS OF PROGRAMMING LANGUAGES BY MEANS OF THREE-VALUED TRUTH TABLESGOTTLOB G.1982; INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC. 12/1982-05-25/PARIS; USA; NEW YORK: IEEE; DA. 1982; PP. 81-87; BIBL. 5 REF.Conference Paper

The complexity of default reasoning under the stationary fixed point semanticsGOTTLOB, G.Information and computation (Print). 1995, Vol 121, Num 1, pp 81-92, issn 0890-5401Article

NP trees and Carnap's modal logicGOTTLOB, G.Journal of the Association for Computing Machinery. 1995, Vol 42, Num 2, pp 421-457, issn 0004-5411Article

Subsumption and implicationGOTTLOB, G.Information processing letters. 1987, Vol 24, Num 2, pp 109-111, issn 0020-0190Article

Translating default logic into standard autoepistemic logicGOTTLOB, G.Journal of the Association for Computing Machinery. 1995, Vol 42, Num 4, pp 711-740, issn 0004-5411Article

On the size of nonredundant FD-coversGOTTLOB, G.Information processing letters. 1987, Vol 24, Num 6, pp 355-360, issn 0020-0190Article

The complexity of logic-based abductionEITER, T; GOTTLOB, G.Journal of the Association for Computing Machinery. 1995, Vol 42, Num 1, pp 3-42, issn 0004-5411Article

Propositional circumscription and extended closed-world reasoning are Π2P-completeEITER, T; GOTTLOB, G.Theoretical computer science. 1993, Vol 114, Num 2, pp 231-245, issn 0304-3975Article

Removing redundancy from a clauseGOTTLOB, G; FERMÜLLER, C. G.Artificial intelligence. 1993, Vol 61, Num 2, pp 263-289, issn 0004-3702Article

On the efficiency of subsumption algorithmsGOTTLOB, G; LEITSCH, A.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 2, pp 280-295, issn 0004-5411Article

Cumulative default logic : finite characterization, algorithms, and complexityGOTTLOB, G; ZHANG MINGYI.Artificial intelligence. 1994, Vol 69, Num 1-2, pp 329-345, issn 0004-3702Article

Translating SQL into relational algebra: optimization, semantics, and equivalence of SQL queriesCERI, S; GOTTLOB, G.IEEE transactions on software engineering. 1985, Vol 11, Num 4, pp 324-345, issn 0098-5589Article

Normalization of relations and PrologCERI, S; GOTTLOB, G.Communications of the ACM. 1986, Vol 29, Num 6, pp 524-544, issn 0001-0782Article

Identifying the minimal transversals of a hypergraph and related problemsEITER, T; GOTTLOB, G.SIAM journal on computing (Print). 1995, Vol 24, Num 6, pp 1278-1304, issn 0097-5397Article

On the complexity of propositional knowledge base revision, updates, and counterfactualsEITER, T; GOTTLOB, G.Artificial intelligence. 1992, Vol 57, Num 2-3, pp 227-270, issn 0004-3702Article

Modular logic programming and generalized quantifiersEITER, T; GOTTLOB, G; VEITH, H et al.Lecture notes in computer science. 1997, pp 289-308, issn 0302-9743, isbn 3-540-63255-7Conference Paper

Magic semi-joinsCERI, S; GOTTLOB, G; TANCA, L et al.Information processing letters. 1989, Vol 33, Num 2, pp 97-107, issn 0020-0190Article

On the complexity of single-rule Datalog queriesGOTTLOB, G; PAPADIMITRIOU, C.Lecture notes in computer science. 1999, pp 201-222, issn 0302-9743, isbn 3-540-66492-0Conference Paper

Selective inheritance of attribute values in relational databasesGOTTLOB, G; SCHREFL, M; STUMPTNER, M et al.Discrete applied mathematics. 1992, Vol 40, Num 2, pp 187-216, issn 0166-218XArticle

Taxonomy and formal properties of distributed joinsCERI, C; GOTTLOB, G; PELAGATTI, G et al.Information systems (Oxford). 1986, Vol 11, Num 1, pp 25-40, issn 0306-4379Article

On tractable queries and constraintsGOTTLOB, G; LEONE, N; SCARCELLO, F et al.Lecture notes in computer science. 1999, pp 1-15, issn 0302-9743, isbn 3-540-66448-3Conference Paper

Default logic as a query languageCADOLI, M; EITER, T; GOTTLOB, G et al.IEEE transactions on knowledge and data engineering. 1997, Vol 9, Num 3, pp 448-463, issn 1041-4347Article

On the complexity of some inductive logic programming problemsGOTTLOB, G; LEONE, N; SCARCELLO, F et al.Lecture notes in computer science. 1997, pp 17-32, issn 0302-9743, isbn 3-540-63514-9Conference Paper

The complexity of nested counterfactuals and iterated knowledge base revisionsEITER, T; GOTTLOB, G.Journal of computer and system sciences (Print). 1996, Vol 53, Num 3, pp 497-512, issn 0022-0000Conference Paper

Efficient database access from PrologCERI, S; GOTTLOB, G; WIEDERHOLD, G et al.IEEE transactions on software engineering. 1989, Vol 15, Num 2, pp 153-164, issn 0098-5589Article

  • Page / 2