Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("EITER, T")

Document Type [dt]

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

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 23 of 23

  • Page / 1
Export

Selection :

  • and

Generating Boolean μ-expressionsEITER, T.Acta informatica. 1995, Vol 32, Num 2, pp 171-187, issn 0001-5903Article

Exact transversal hypergraphs and application to Boolean μ-functionsEITER, T.Journal of symbolic computation. 1994, Vol 17, Num 3, pp 215-225, issn 0747-7171Article

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

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

An efficient method for eliminating varying predicates from a cricumscriptionCADOLI, M; EITER, T; GOTTLOB, G et al.Artificial intelligence. 1992, Vol 54, Num 3, pp 397-410, issn 0004-3702Article

Recognizing renamable generalized propositional Horn formulas is NP-completeEITER, T; KILPELÄINEN, P; MANNILA, H et al.Discrete applied mathematics. 1995, Vol 59, Num 1, pp 23-31, issn 0166-218XArticle

Planning under incomplete knowledgeEITER, T; FABER, W; LEONE, N et al.Lecture notes in computer science. 2000, pp 807-821, issn 0302-9743, isbn 3-540-67797-6Conference Paper

The complexity class Θ2p : Recent results and applications in AI and modal logicEITER, T; GOTTLOB, G.Lecture notes in computer science. 1997, pp 1-18, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Bidual Horn functions and extensions : The Satisfiability ProblemEITER, T; LBARAKI, T; MAKINO, K et al.Discrete applied mathematics. 1999, Vol 96-97, pp 55-88, issn 0166-218XArticle

Expressive power and complexity of partial models for disjunctive deductive databasesEITER, T; LEONE, N; SACCA, D et al.Theoretical computer science. 1998, Vol 206, Num 1-2, pp 181-218, issn 0304-3975Article

Double Horn functionsEITER, T; IBARAKI, T; MAKINO, K et al.Information and computation (Print). 1998, Vol 144, Num 2, pp 155-190, issn 0890-5401Article

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 difference of Horn theoriesEITER, T; IBARAKI, T; MAKINO, K et al.Lecture notes in computer science. 1999, pp 467-477, issn 0302-9743, isbn 3-540-65691-XConference Paper

Computing non-ground representations of stable modelsEITER, T; LU, J; SUBRAHMANIAN, V. S et al.Lecture notes in computer science. 1997, pp 198-217, issn 0302-9743, isbn 3-540-63255-7Conference Paper

Progress report on the disjunctive deductive database system dlvEITER, T; LEONE, N; MATEIS, C et al.Lecture notes in computer science. 1998, pp 148-163, issn 0302-9743, isbn 3-540-65082-2Conference Paper

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

Two-face Horn extensionsEITER, T; IBARAKI, T; MAKINO, K et al.Lecture notes in computer science. 1997, pp 112-121, issn 0302-9743, isbn 3-540-63890-3Conference Paper

On disguised double horn functions and extensionsEITER, T; IBARAKI, T; MAKINO, K et al.Lecture notes in computer science. 1998, pp 50-60, issn 0302-9743, isbn 3-540-64230-7Conference Paper

Disjunctions of Horn theories and their coresEITER, T; IBARAKI, T; MAKINO, K et al.Lecture notes in computer science. 1998, pp 49-58, issn 0302-9743, isbn 3-540-65385-6Conference Paper

A deductive system for non-monotonic reasoningEITER, T; LEONEA, N; MATEIS, C et al.Lecture notes in computer science. 1997, pp 363-374, issn 0302-9743, isbn 3-540-63255-7Conference 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

  • Page / 1