Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
129 | Alan Nash, Jeffrey B. Remmel, Victor Vianu |
PTIME Queries Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings, pp. 274-288, 2005, Springer, 3-540-24288-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
87 | Andrzej S. Murawski, C.-H. Luke Ong |
Discreet Games, Light Affine Logic and PTIME Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings, pp. 427-441, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
PTIME, Complexity, Linear Logic, Game Semantics |
65 | Harry G. Mairson, Kazushige Terui |
On the Computational Complexity of Cut-Elimination in Linear Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings, pp. 23-36, 2003, Springer, 3-540-20216-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
64 | Linh Anh Nguyen |
Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings, pp. 438-439, 2007, Springer, 978-3-540-74608-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
52 | Pauline Berry, Bart Peintner, Ken Conley, Melinda T. Gervasio, Tomás E. Uribe, Neil Yorke-Smith |
Deploying a personalized time management agent. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 1564-1571, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
scheduling, user interfaces, deployment, personal assistants |
51 | David Van Horn, Harry G. Mairson |
Flow Analysis, Linearity, and PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 16-18, 2008. Proceedings, pp. 255-269, 2008, Springer, 978-3-540-69163-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Manizheh Montazerian, Peter T. Wood, Seyed R. Mousavi |
XPath Query Satisfiability is in PTIME for Real-World DTDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
XSym ![In: Database and XMLTechnologies, 5th International XML Database Symposium, XSym 2007, Vienna, Austria, September 23-24, 2007, Proceedings, pp. 17-30, 2007, Springer, 978-3-540-75287-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Document Type Definitions, Satisfiability, XPath |
51 | Guillaume Bonfante |
Some Programming Languages for Logspace and Ptime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMAST ![In: Algebraic Methodology and Software Technology, 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings, pp. 66-80, 2006, Springer, 3-540-35633-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Vladimir Yu. Sazonov, Alexei Lisitsa 0001 |
Delta-Languages for Sets and sub-PTIME Graphs Transformers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT'95, 5th International Conference, Prague, Czech Republic, January 11-13, 1995, Proceedings, pp. 125-138, 1995, Springer, 3-540-58907-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
39 | Avigdor Gal, Maria Vanina Martinez, Gerardo I. Simari, V. S. Subrahmanian |
Aggregate Query Answering under Uncertain Schema Mappings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 940-951, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Peter T. Wood |
Containment for XPath Fragments under DTD Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2003, 9th International Conference, Siena, Italy, January 8-10, 2003, Proceedings, pp. 297-311, 2003, Springer, 3-540-00323-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
39 | Manolis Koubarakis, Spiros Skiadopoulos |
Tractable Query Answering in Indefinite Constraint Databases: Basic Results and Applications to Querying Spatiotemporal Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Spatio-Temporal Database Management ![In: Spatio-Temporal Database Management, International Workshop STDBM'99, Edinburgh, Scotland, September 10-11, 1999, Proceedings, pp. 204-223, 1999, Springer, 3-540-66401-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Tomasz Imielinski, Kumar V. Vadaparty |
Complexity of Query Processing in Databases with OR-Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania, USA, pp. 51-65, 1989, ACM Press, 0-89791-308-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
38 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, pp. 150-166, 2006, Springer, 3-540-45458-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Luca Corciulo, Fosca Giannotti, Dino Pedreschi |
Datalog with Non-Deterministic Choice Computes NDB-PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DOOD ![In: Deductive and Object-Oriented Databases, Third International Conference, DOOD'93, Phoenix, Arizona, USA, December 6-8, 1993, Proceedings, pp. 49-66, 1993, Springer, 3-540-57530-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
26 | Wolfgang Gatterbauer, Dan Suciu |
Data conflict resolution using trust mappings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010, pp. 219-230, 2010, ACM, 978-1-4503-0032-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
community database, consistency, data exchange, stable model |
26 | David Zook, Emir Pasalic, Beata Sarna-Starosta |
Typed Datalog. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages, 11th International Symposium, PADL 2009, Savannah, GA, USA, January 19-20, 2009. Proceedings, pp. 168-182, 2009, Springer, 978-3-540-92994-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Meta-compilation, Type System, Datalog, Deductive Databases |
26 | Abhay Kumar Jha, Vibhor Rastogi, Dan Suciu |
Query evaluation with soft-key constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada, pp. 119-128, 2008, ACM, 978-1-60558-108-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
query processing, probabilistic databases |
26 | Nilesh N. Dalvi, Dan Suciu |
The dichotomy of conjunctive queries on probabilistic structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 293-302, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
probabilistic databases, conjunctive queries, dichotomy |
26 | Marcin Jurdzinski, François Laroussinie, Jeremy Sproston |
Model Checking Probabilistic Timed Automata with One or Two Clocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007, Proceedings, pp. 170-184, 2007, Springer, 978-3-540-71208-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Marco Gaboardi, Simona Ronchi Della Rocca |
A Soft Type Assignment System for lambda -Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 253-267, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Henrik Björklund, Wim Martens, Thomas Schwentick |
Conjunctive Query Containment over Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBPL ![In: Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers, pp. 66-80, 2007, Springer, 978-3-540-75986-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Georg Gottlob, Christoph Koch 0001, Reinhard Pichler, Luc Segoufin |
The complexity of XPath query evaluation and XML typing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(2), pp. 284-335, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
LOGCFL, XML, Complexity, XPath, DTD |
26 | Weirong Wang, Aloysius K. Mok, Gerhard Fohler |
Pre-Scheduling on the Domain of Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTSS ![In: Proceedings of the 25th IEEE Real-Time Systems Symposium (RTSS 2004), 5-8 December 2004, Lisbon, Portugal, pp. 68-77, 2004, IEEE Computer Society, 0-7695-2247-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Régis Barbanchon, Etienne Grandjean |
The Minimal Logically-Defined NP-Complete Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 338-349, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Computational complexity, NP-completeness, descriptive complexity, finite model theory, parsimony, second-order logic |
26 | Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi |
View-Based Query Processing and Constraint Satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 361-371, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
view-based query answering, view-based query rewriting, databases, constraint satisfaction, semistructured data |
26 | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer 0001 |
Hyper-Polynomial Hierarchies and the NP-Jump. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 102-110, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | Hans Leiß |
Bounded Fixed-Point Definability and Tabular Recognition of Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 9th International Workshop, CSL '95, Annual Conference of the EACSL, Paderborn, Germany, September 22-29, 1995, Selected Papers, pp. 388-402, 1995, Springer, 3-540-61377-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
26 | Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson |
An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 83-105, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
26 | Arnold Schönhage |
On the Power of Random Access Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 520-529, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
26 | Juris Hartmanis, Theodore P. Baker |
Relative Succinctness of Representations of Languages and Separation of Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, pp. 70-88, 1979, Springer, 0-387-09526-8. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
25 | Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen |
Subclasses of Ptime Interpreted by Programming Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 67(3), pp. 437-472, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Eugenia Ternovska |
Towards Capturing PTIME with no Counting Construct (but with a Choice Operator). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.07978, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
25 | Neil D. Jones, Siddharth Bhaskar, Cynthia Kop, Jakob Grue Simonsen |
Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VPT/HCVS@ETAPS ![In: Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, VPT/HCVS@ETAPS 2020, Dublin, Ireland, 25-26th April 2020., pp. 65-79, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Utkarsh Gupta, Preey Shah, S. Akshay 0001, Piotr Hofman |
Continuous Reachability for Unordered Data Petri nets is in PTime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.05604, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Utkarsh Gupta, Preey Shah, S. Akshay 0001, Piotr Hofman |
Continuous Reachability for Unordered Data Petri Nets is in PTime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, pp. 260-276, 2019, Springer, 978-3-030-17126-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Pablo Barceló, Cristina Feier, Carsten Lutz, Andreas Pieris |
PTime Combined Complexity and FPT in Ontology-Mediated Querying. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 32nd International Workshop on Description Logics, Oslo, Norway, June 18-21, 2019., 2019, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
25 | Tomás Masopust |
Separability by piecewise testable languages is PTime-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 711, pp. 109-114, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter |
Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden., pp. 1861-1867, 2018, ijcai.org, 978-0-9992411-2-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Cynthia Kop |
On First-order Cons-free Term Rewriting and PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1711.03399, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
25 | Tomás Masopust |
Separability by Piecewise Testable Languages is PTime-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.07856, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
25 | André Hernich, Carsten Lutz, Fabio Papacchini, Frank Wolter |
Horn Rewritability vs PTime Query Answering for Description Logic TBoxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, July 18-21, 2017., 2017, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
25 | Kenneth R. Blaney, Andrey Nikolaev |
A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Groups Complex. Cryptol. ![In: Groups Complex. Cryptol. 8(1), pp. 69-74, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
25 | Clément Aubert, Marc Bagnol, Thomas Seiller |
Unary Resolution: Characterizing Ptime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, pp. 373-389, 2016, Springer, 978-3-662-49629-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Filip Konecný |
PTIME Computation of Transitive Closures of Octagonal Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, pp. 645-661, 2016, Springer, 978-3-662-49673-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Clément Aubert, Marc Bagnol, Thomas Seiller |
Memoization for Unary Logic Programming: Characterizing PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1501.05104, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
25 | Patrick Baillot |
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 241, pp. 3-31, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Filip Konecný |
PTIME Computation of Transitive Closures of Octagonal Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.2102, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
25 | David Van Horn, Harry G. Mairson |
Flow analysis, linearity, and PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1311.5825, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
25 | Jakub Szymanik |
Backward Induction Is PTIME-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LORI ![In: Logic, Rationality, and Interaction - 4th International Workshop, LORI 2013, Hangzhou, China, October 9-12, 2013, Proceedings, pp. 352-356, 2013, Springer, 978-3-642-40947-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Barbara Dunin-Keplicz, Linh Anh Nguyen, Andrzej Szalas |
Horn-TeamLog: A Horn Fragment of TeamLog with PTime Data Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCI ![In: Computational Collective Intelligence. Technologies and Applications - 5th International Conference, ICCCI 2013, Craiova, Romania, September 11-13, 2013, Proceedings, pp. 143-153, 2013, Springer, 978-3-642-40494-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | David Toman 0001, Grant E. Weddell |
CFDnc: A PTIME Description Logic with Functional Constraints and Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23 - 26, 2013, pp. 451-463, 2013, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
25 | Linh Anh Nguyen, Thi-Bich-Loc Nguyen, Andrzej Szalas |
HornDL: An Expressive Horn Description Logic with PTime Data Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RR ![In: Web Reasoning and Rule Systems - 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings, pp. 259-264, 2013, Springer, 978-3-642-39665-6. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | David Toman 0001, Grant E. Weddell |
Conjunctive Query Answering in CFDnc : A PTIME Description Logic with Functional Constraints and Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australasian Conference on Artificial Intelligence ![In: AI 2013: Advances in Artificial Intelligence - 26th Australasian Joint Conference, Dunedin, New Zealand, December 1-6, 2013. Proceedings, pp. 350-361, 2013, Springer, 978-3-319-03679-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Jacek Chrzaszcz, Aleksy Schubert |
ML with PTIME complexity guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France, pp. 198-212, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-42-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Pauline M. Berry, Melinda T. Gervasio, Bart Peintner, Neil Yorke-Smith |
PTIME: Personalized assistance for calendaring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Intell. Syst. Technol. ![In: ACM Trans. Intell. Syst. Technol. 2(4), pp. 40:1-40:22, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Werner Damm, Carsten Ihlemann, Viorica Sofronie-Stokkermans |
PTIME Parametric Verification of Safety Properties for Reasonable Linear Hybrid Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 5(4), pp. 469-497, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Linh Anh Nguyen |
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 104(4), pp. 349-384, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Yijia Chen, Jörg Flum |
On optimal proof systems and logics for PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
25 | Aloïs Brunel, Kazushige Terui |
Church => Scott = Ptime: an application of resource sensitive realizability ![Search on Bibsonomy](Pics/bibsonomy.png) |
DICE ![In: Proceedings International Workshop on Developments in Implicit Computational complExity, DICE 2010, Paphos, Cyprus, 27-28th March 2010., pp. 31-46, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Yijia Chen, Jörg Flum |
On p-Optimal Proof Systems and Logics for PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II, pp. 321-332, 2010, Springer, 978-3-642-14161-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Yijia Chen, Jörg Flum |
A Logic for PTIME and a Parameterized Halting Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fields of Logic and Computation ![In: Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, pp. 251-276, 2010, Springer, 978-3-642-15024-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Yijia Chen, Jörg Flum |
A Logic for PTIME and a Parameterized Halting Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 397-406, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Michael J. Burrell, J. Robin B. Cockett, Brian F. Redmond |
Pola: A Language for PTIME Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FICS ![In: 6th Workshop on Fixed Points in Computer Science, FICS 2009, Coimbra, Portugal, September 12-13, 2009., pp. 7-8, 2009, Institute of Cybernetics, 978-9949-430-29-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
25 | David Toman 0001, Grant E. Weddell |
Applications and Extensions of PTIME Description Logics with Functional Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pp. 948-954, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
25 | Yijia Chen, Jörg Flum |
A logic for PTIME and a parameterized halting problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR08, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
25 | Martin Grohe |
The Quest for a Logic Capturing PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 267-271, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
query languages, descriptive complexity, finite model theory |
25 | Florian Horn 0001 |
Explicit Muller Games are PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India, pp. 235-243, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0710.1153, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
25 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 3(4), 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Atassi, Patrick Baillot, Kazushige Terui |
Verification of Ptime reducibility for system F terms via Dual Light Affine Logic ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0603104, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
25 | Zdenek Sawa, Petr Jancar |
Behavioural Equivalences on Finite-State Systems are PTIME-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Artif. Intell. ![In: Comput. Artif. Intell. 24(5), pp. 513-528, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
25 | Nicolas Markey, Philippe Schnoebelen |
A PTIME-complete matching problem for SLP-compressed words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 90(1), pp. 3-6, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Harry G. Mairson |
Linear lambda calculus and PTIME-completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Funct. Program. ![In: J. Funct. Program. 14(6), pp. 623-633, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Manolis Koubarakis, Spiros Skiadopoulos |
Querying temporal and spatial constraint networks in PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 123(1-2), pp. 223-263, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Martin Otto 0001 |
Bisimulation-invariant PTIME and higher-dimensional µ-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 224(1-2), pp. 237-265, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Neil D. Jones |
LOGSPACE and PTIME Characterized by Programming Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 228(1-2), pp. 151-174, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Patrick Doherty 0001, Witold Lukaszewicz, Andrzej Szalas |
Declarative PTIME Queries for Relational Databases using Quantifier Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 9(5), pp. 737-758, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Manolis Koubarakis, Spiros Skiadopoulos |
Querying Temporal Constraint Networks in PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI/IAAI ![In: Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, July 18-22, 1999, Orlando, Florida, USA., pp. 745-750, 1999, AAAI Press / The MIT Press, 0-262-51106-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
25 | Fosca Giannotti, Dino Pedreschi |
Datalog with Non-Deterministic Choice Computers NDB-PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Program. ![In: J. Log. Program. 35(1), pp. 79-101, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Christine Ann Haught, Theodore A. Slaman |
Automorphisms in the PTIME-Turing Degrees of Recursive Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 84(1), pp. 139-152, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
25 | Martin Otto 0001 |
Capturing Bisimulation-Invariant Ptime. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6-12, 1997, Proceedings, pp. 294-305, 1997, Springer, 3-540-63045-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
25 | Lauri Hella |
Logical Hierarchies in PTIME. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 129(1), pp. 1-19, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Martin Otto 0001 |
Ptime Canonization for Two Variables with Counting ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, USA, June 26-29, 1995, pp. 342-352, 1995, IEEE Computer Society, 0-8186-7050-9. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
25 | Alexei P. Stolboushkin, Michael A. Taitslin |
Is First Order Contained in an Initial Segment of PTIME? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers, pp. 242-248, 1994, Springer, 3-540-60017-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Lauri Hella |
Logical Hierarchies in PTIME ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), Santa Cruz, California, USA, June 22-25, 1992, pp. 360-368, 1992, IEEE Computer Society, 0-8186-2735-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
25 | Juichi Shinoda, Theodore A. Slaman |
On the Theory of the PTIME Degrees of the Recursive Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 41(3), pp. 321-366, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
25 | Pratul Dublish, S. N. Maheshwari |
Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 246-253, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
25 | Juichi Shinoda, Theodore A. Slaman |
On the theory of the PTIME degrees of the recursive sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988, pp. 252-257, 1988, IEEE Computer Society, 0-8186-0794-7. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
13 | Nilesh N. Dalvi, Karl Schnaitter, Dan Suciu |
Computing query probability with incidence algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, June 6-11, 2010, Indianapolis, Indiana, USA, pp. 203-214, 2010, ACM, 978-1-4503-0033-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
incidence algebra, mobius inversion, probabilistic database |
13 | Nobutaka Suzuki, Yuji Fukushima |
Satisfiability of simple xpath fragments in the presence of dtds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WIDM ![In: 11th ACM International Workshop on Web Information and Data Management (WIDM 2009), Hong Kong, China, November 2, 2008, pp. 15-22, 2009, ACM, 978-1-60558-808-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
satisfiability, xpath, xml, dtd |
13 | Xiang Zhou |
CFI Construction and Balanced Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 97-107, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Dario Colazzo, Giorgio Ghelli, Carlo Sartiani |
Efficient asymmetric inclusion between regular expression types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings, pp. 174-182, 2009, ACM, 978-1-60558-423-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
language inclusion, XML, regular expressions |
13 | Daniel Deutch, Tova Milo |
TOP-K projection queries for probabilistic business processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings, pp. 239-251, 2009, ACM, 978-1-60558-423-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Trivedi 0001 |
Concavely-Priced Probabilistic Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings, pp. 415-430, 2009, Springer, 978-3-642-04080-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Phiniki Stouppa, Thomas Studer |
Data Privacy for Knowledge Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, pp. 409-421, 2009, Springer, 978-3-540-92686-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Byron Choi, Gao Cong, Wenfei Fan, Stratis Viglas |
Updating Recursive XML Views of Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 23(4), pp. 516-537, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
XML, view update, XML views, XML publishing |
13 | Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios Kementsietsidis |
Conditional functional dependencies for capturing data inconsistencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 33(2), pp. 6:1-6:48, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
SQL, functional dependency, Data cleaning |
13 | Haiming Chen, Lei Chen |
Inclusion Test Algorithms for One-Unambiguous Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings, pp. 96-110, 2008, Springer, 978-3-540-85761-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
One-unambiguous regular expression, algorithm, inclusion |
13 | Jianfeng Du, Yi-Dong Shen |
Computing minimum cost diagnoses to repair populated DL-based ontologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008, pp. 565-574, 2008, ACM, 978-1-60558-085-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
ontologies, diagnosis, description logics, disjunctive datalog |