|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3642 occurrences of 1964 keywords
|
|
|
Results
Found 5530 publication records. Showing 5530 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
101 | Klaus Ambos-Spies, Levke Bentzien |
Separating NP-Completeness Notions under Strong Hypotheses. ![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. 121-127, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
NP-completeness notions separation, strong hypotheses, NP-m-completeness, NP-T-completeness, bounded-query reducibilities, resource bounded Baire category concept, computational complexity, resource bounded measure |
95 | Daniel Leivant |
On the Completeness of Dynamic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 78-91, 2009, Springer, 978-3-642-00595-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
inductive completeness, relative completeness, arithmetical completeness, Dynamic logic |
93 | S. Karunanithi, Arthur D. Friedman |
Some New Types of Logical Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 27(11), pp. 998-1005, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
weak completeness, Combinational functions, complement completeness, dual completeness, logic primitives, necessary and sufficient conditions for c-completeness, strong c-completeness, weak c-completeness, strong completeness |
88 | Zhenghua Pan |
Relation between Semantic Completeness and Syntax Completeness on General Formal Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SKG ![In: 2006 International Conference on Semantics, Knowledge and Grid (SKG 2006), 1-3 November 2006, Guilin, China, pp. 89, 2006, IEEE Computer Society, 0-7695-2673-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
73 | Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng |
A Comparison of Weak Completeness Notions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 171-178, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Weak Completeness, Measure, Genericity, Completeness |
57 | Alioune Ngom, Corina Reischer, Dan A. Simovici, Ivan Stojmenovic |
Completeness Criteria in Set-Valued Logic Under Compositions with Union and Intersection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 27th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1997, Antigonish, Nova Scotia, Canada, May 28-30, 1997, Proceedings, pp. 75-82, 1997, IEEE Computer Society, 0-8186-7910-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
completeness criteria, set-valued logic, Boolean completeness problems, r-valued set logic, logic of functions, n-tuples, set logic circuits, S-complete, U-maximal sets, completeness criterion, U functions, compositions, Boolean functions, Boolean functions, intersection, union |
56 | Jens Knoop, Oliver Rüthing |
Optimization Under the Perspective of Soundness, Completeness, and Reusability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Correct System Design ![In: Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel), pp. 288-315, 1999, Springer, 3-540-66624-9. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Programming paradigms (imperative, explicitly parallel, object-oriented), safety and coincidence theorems, optimizer generators, optimality, completeness, data-flow analysis, reusability, soundness, program optimization, code motion, admissibility |
55 | Yuan Lin 0005, Richard C. Holt, Andrew J. Malton |
Completeness of a Fact Extractor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCRE ![In: 10th Working Conference on Reverse Engineering, WCRE 2003, Victoria, Canada, November 13-16, 2003, pp. 196-205, 2003, IEEE Computer Society, 0-7695-2027-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
51 | John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran |
Partial Bi-immunity, Scaled Dimension, and NP-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 42(2), pp. 131-142, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Many-one completeness, Bi-immunity, Scaled dimension, Turing completeness |
50 | Mila Dalla Preda |
Completeness Refinement in Abstract Symbolic Trajectory Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings, pp. 38-52, 2004, Springer, 3-540-22791-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Domain Refinement, Model-checking, Verification, Abstract Interpretation, Completeness, Data Flow Analysis, Symbolic Trajectory Evaluation |
50 | Reiner Hähnle, Neil V. Murray, Erik Rosenthal |
Completeness for Linear Regular Negation Normal Form Inference Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 10th International Symposium, ISMIS '97, Charlotte, North Carolina, USA, October 15-18, 1997, Proceedings, pp. 590-599, 1997, Springer, 3-540-63614-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
tableau method, non-clausal inference, negation normal form, completeness, resolution, Logic for Artificial Intelligence |
50 | Roberto Giacobazzi, Elisa Quintarelli |
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAS ![In: Static Analysis, 8th International Symposium, SAS 2001, Paris, France, July 16-18, 2001, Proceedings, pp. 356-373, 2001, Springer, 3-540-42314-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Domain Refinement, Model-checking, Verification, Program Analysis, Abstract Interpretation, Completeness |
49 | Tauqeer Hussain, Mian M. Awais |
An Effort-Based Approach to Measure Completeness of an Entity-Relationship Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIS-ICIS ![In: 7th IEEE/ACIS International Conference on Computer and Information Science, IEEE/ACIS ICIS 2008, 14-16 May 2008, Portland, Oregon, USA, pp. 463-468, 2008, IEEE Computer Society, 978-0-7695-3131-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
49 | Reinhard Pichler |
Completeness and Redundancy in Constrained Clause Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTP (LNCS Selection) ![In: Automated Deduction in Classical and Non-Classical Logics, Selected Papers, pp. 221-235, 1998, Springer, 3-540-67190-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
49 | Daniel Leivant, Tim Fernando |
Skinny and Fleshy Failures of Relative Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, Germany, January 21-23, 1987, pp. 246-252, 1987, ACM Press, 0-89791-215-2. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
45 | Boris A. Romov |
Completeness Theory for Vector Partial Multiple-Valued Logic Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 86-91, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
completeness theory, vector partial multiple-valued logic functions, completeness criterion, multiple-base invariant relations algebra, restricted quantifier free calculus, multivalued logic, Galois connection |
45 | Adel Bouhoula |
Simultaneous checking of completeness and ground confluence for algebraic specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 10(3), pp. 20:1-20:33, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
ground confluence, completeness, algebraic specifications, parameterization, term rewriting systems, Automated deduction |
45 | Donald P. Ballou, Harold L. Pazer |
Modeling Completeness versus Consistency Tradeoffs in Information Decision Contexts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 15(1), pp. 240-243, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
tradeoffs for data quality, consistency, decision making, Completeness, data quality |
45 | James Clifford, Albert Croker, Alexander Tuzhilin |
On Completeness of Historical Relational Query Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 19(1), pp. 64-116, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
temporal grouping, temporal logic, query languages, completeness, temporal databases, relational model, historical databases |
45 | Deepak Kapur, Paliath Narendran, Hantao Zhang 0001 |
Complexity of Sufficient-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings, pp. 426-442, 1986, Springer, 3-540-17179-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
normal forms, term rewriting systems, PSPACE, Sufficient-completeness |
44 | Rotem Oshman |
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings, pp. 275-289, 2009, Springer, 978-3-540-93899-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Joe Hendrix, José Meseguer 0001 |
On the Completeness of Context-Sensitive Order-Sorted Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings, pp. 229-245, 2007, Springer, 978-3-540-73447-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Aart Middeldorp, Yoshihito Toyama |
Completeness of Combinations of Constructor Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 188-199, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
44 | François Bancilhon |
On the Completeness of Query Languages for Relational Data Bases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1978, Proceedings, 7th Symposium, Zakopane, Poland, September 4-8, 1978, pp. 112-123, 1978, Springer, 0-387-08921-7. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
39 | Francesc Esteva, Lluís Godo, Carles Noguera |
Expanding the propositional logic of a t-norm with truth-constants: completeness results for rational semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 14(3), pp. 273-284, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Mathematical fuzzy logic, Left-continuous t-norms, T-norm based logics, Truth-constants, Evaluated formulae, Real and rational completeness |
39 | Omer Horvitz, Virgil D. Gligor |
Weak Key Authenticity and the Computational Completeness of Formal Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings, pp. 530-547, 2003, Springer, 3-540-40674-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Weak Key Authenticity, Authentication, Cryptography, Encryption, Completeness, Formal Reasoning |
38 | Michele Basaldella, Kazushige Terui |
On the Meaning of Logical Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings, pp. 50-64, 2009, Springer, 978-3-642-02272-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
38 | Venkatesan Guruswami |
On 2-Query Codeword Testing with Near-Perfect Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 267-276, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | David A. Schmidt |
Comparing Completeness Properties of Static Analyses and Their Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 4th Asian Symposium, APLAS 2006, Sydney, Australia, November 8-10, 2006, Proceedings, pp. 183-199, 2006, Springer, 3-540-48937-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Jit Biswas, Felix Naumann, Qiang Qiu |
Assessing the Completeness of Sensor Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 11th International Conference, DASFAA 2006, Singapore, April 12-15, 2006, Proceedings, pp. 717-732, 2006, Springer, 3-540-33337-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Tauqeer Hussain, Mian M. Awais, Shafay Shamail |
A Fuzzy Based Approach to Measure Completeness of an Entity-Relationship Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ER (Workshops) ![In: Perspectives in Conceptual Modeling, ER 2005 Workshops AOIS, BP-UML, CoMoGIS, eCOMO, and QoIS, Klagenfurt, Austria, October 24-28, 2005, Proceedings, pp. 410-422, 2005, Springer, 3-540-29395-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
38 | Satoshi Okui, Aart Middeldorp, Tetsuo Ida |
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22-26, 1995, Proceedings, pp. 394-408, 1995, Springer, 3-540-59293-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
38 | Edgar Knapp |
Soundness and Completeness of UNITY Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 14th Conference, Madras, India, December 15-17, 1994, Proceedings, pp. 378-389, 1994, Springer, 3-540-58715-2. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Classification Theory of Programming Languages, Logic in Computer Science, Theory of Parallel and Distributed Computation |
34 | Xiaodan Chen, Shaobai Chen |
On the Upper Completeness of Quasi-metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IITSI ![In: Third International Symposium on Intelligent Information Technology and Security Informatics, IITSI 2010, Jinggangshan, China, April 2-4, 2010, pp. 446-449, 2010, IEEE Computer Society, 978-0-7695-4020-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Quasi-metric space, upper limit, upper closed set, Yoneda-completeness, upper completeness |
34 | Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara |
Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 433-444, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
# P-completeness, NP-completeness, polynomial time algorithm, enumeration, independent set, Chordal graph, counting |
34 | Pierluigi Crescenzi |
Using AVs to explain NP-completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 15th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2010, Bilkent, Ankara, Turkey, June 26-30, 2010, pp. 299, 2010, ACM, 978-1-60558-729-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
NP-completeness, algorithm visualization |
34 | Fabian Panse, Norbert Ritter |
Completeness in Databases with Maybe-Tuples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ER Workshops ![In: Advances in Conceptual Modeling - Challenging Perspectives, ER 2009 Workshops CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS, Gramado, Brazil, November 9-12, 2009. Proceedings, pp. 202-211, 2009, Springer, 978-3-642-04946-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
data completeness, maybe tuple, probabilistic database |
34 | Gerard R. Renardel de Lavalette, Barteld P. Kooi, Rineke Verbrugge |
Strong Completeness and Limited Canonicity for PDL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 17(1), pp. 69-87, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Canonical model, Model disharmony, Propositional dynamic logic, Strong completeness |
34 | Marcel Karnstedt, Kai-Uwe Sattler, Michael Haß, Manfred Hauswirth, Brahmananda Sapkota, Roman Schmidt |
Approximating query completeness by predicting the number of answers in DHT-based web applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WIDM ![In: 10th ACM International Workshop on Web Information and Data Management (WIDM 2008), Napa Valley, California, USA, October 30, 2008, pp. 71-78, 2008, ACM, 978-1-60558-260-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
query completeness, query processing, dht, probabilistic guarantees |
34 | Gilberto A. Cysneiros Filho, Andrea Zisman |
Traceability and completeness checking for agent-oriented systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008, pp. 71-77, 2008, ACM, 978-1-59593-753-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
completeness checking, multi-agent systems, traceability, agent oriented software engineering |
34 | Lian Yu, Shuang Su, Shan Luo, Yu Su 0007 |
Completeness and Consistency Analysis on Requirements of Distributed Event-Driven Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TASE ![In: Second IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering, TASE 2008, June 17-19, 2008, Nanjing, China, pp. 241-244, 2008, IEEE Computer Society, 978-0-7695-3249-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Completeness and consistency analysis, requirement-related faults, formal scenario model, inconsistency elimination, event-driven systems |
34 | Mark Burgin |
Universality, Reducibility, and Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCU ![In: Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings, pp. 24-38, 2007, Springer, 978-3-540-74592-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
problem completeness, algorithm, computability, reducibility, universal, computing power, problem hardness |
34 | David S. Johnson |
The NP-completeness column. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(1), pp. 160-176, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
lattice bases, NP-completeness, coding theory, perfect graphs, primality testing, open problems |
34 | Radosav S. Dordevic, Miodrag Raskovic, Zoran Ognjanovic |
Completeness theorem for propositional probabilistic models whose measures have only finite ranges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(4), pp. 557-564, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Finite ranges of probabilities, Completeness, Probabilistic logic |
34 | Amit M. Paradkar, Tim Klinger |
Automated Consistency and Completeness Checking of Testing Models for Interactive Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 28th International Computer Software and Applications Conference (COMPSAC 2004), Design and Assessment of Trustworthy Software-Based Systems, 27-30 September 2004, Hong Kong, China, Proceedings, pp. 342-348, 2004, IEEE Computer Society, 0-7695-2209-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Completeness Checking, Reachability, Consistency Checking |
34 | Naijun Zhan |
Completeness of Higher-Order Duration Calculus. ![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. 442-456, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
duration calculus higher-order logic interval temporal logic completeness |
34 | Wolfgang Bibel, Elmar Eder |
Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(2), pp. 320-344, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
connection-graph resolution, decomposition of unsatisfiable formulas, semantic trees, regular graphs, strong completeness |
34 | Adel Bouhoula |
Sufficient Completeness and Parameterized Proofs by Induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, 4th International Conference, ALP'94, Madid, Spain, September 14-16, 1994, Proceedings, pp. 23-40, 1994, Springer, 3-540-58431-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Implicit induction, Parameterized Conditional Specifications, Theorem Proving, Term rewriting systems, Sufficient completeness |
34 | Jan A. Plaza |
Completeness for Propositional Logic Programs with Negation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Methodologies for Intelligent Systems, 6th International Symposium, ISMIS '91, Charlotte, N.C., USA, October 16-19, 1991, Proceedings, pp. 600-609, 1991, Springer, 3-540-54563-8. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
SLD-resolution, knowledge representation in logic, logic programming, declarative programming, constructive negation, rule-based expert systems, non-classical logics, negation as failure, soundness and completeness |
34 | Michael R. Hansen, Zhou Chaochen |
Semantics and Completeness of Duration Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Real-Time: Theory in Practice, REX Workshop, Mook, The Netherlands, June 3-7, 1991, Proceedings, pp. 209-225, 1991, Springer, 3-540-55564-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
relative completeness, real-time systems, verification, specifications, specification languages, proof system, Duration Calculus, Interval Temporal Logic |
34 | Michael Merritt |
Completeness Theorems for Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
REX Workshop ![In: Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop, Mook, The Netherlands, May 29 - June 2, 1989, Proceedings, pp. 544-560, 1989, Springer, 3-540-52559-9. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
state mappings, Specification, implementation, products, completeness, automata |
34 | Pieter J. Collins, C. A. Hendrie |
On Strict Extensions of Nearness Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 8(3), pp. 435-446, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
T-uniformity, nearness space, round Cauchy filter, strict extension, completeness |
33 | Antonio Caruso 0001, Stefano Chessa, Piero Maestrini |
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(7), pp. 917-924, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
isoperimeter, Fault tolerance, Graph Theory, parallel architectures, fault diagnosis, system-level diagnosis |
33 | Zhongnan Shen, Jianwen Su |
On Completeness of Web Service Compositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICWS ![In: 2007 IEEE International Conference on Web Services (ICWS 2007), July 9-13, 2007, Salt Lake City, Utah, USA, pp. 800-807, 2007, IEEE Computer Society, 0-7695-2924-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Marius Petria |
An Institutional Version of Gödel's Completeness Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALCO ![In: Algebra and Coalgebra in Computer Science, Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007, Proceedings, pp. 409-424, 2007, Springer, 978-3-540-73857-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | M. Kathryn Brohman, Richard T. Watson, Gabriele Piccoli, A. Parasuraman |
NCSS Process Completeness: Construct Development and Preliminary Validation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 38th Hawaii International Conference on System Sciences (HICSS-38 2005), CD-ROM / Abstracts Proceedings, 3-6 January 2005, Big Island, HI, USA, 2005, IEEE Computer Society, 0-7695-2268-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Joe Hendrix, Manuel Clavel, José Meseguer 0001 |
A Sufficient Completeness Reasoning Tool for Partial Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings, pp. 165-174, 2005, Springer, 3-540-25596-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Lars Engebretsen, Jonas Holmerin |
Three-Query PCPs with Perfect Completeness over non-Boolean Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 284-299, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Wlodzimierz Drabent, Miroslawa Milkowska |
Proving Correctness and Completeness of Normal Programs - A Declarative Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 17th International Conference, ICLP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, pp. 284-299, 2001, Springer, 3-540-42935-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Holger Spakowski, Jörg Vogel 0001 |
Theta2p-Completeness: A Classical Approach for New Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings., pp. 348-360, 2000, Springer, 3-540-41413-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | M. R. K. Krishna Rao |
Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT ![In: TAPSOFT'95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22-26, 1995, Proceedings, pp. 379-393, 1995, Springer, 3-540-59293-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Aart Middeldorp, Erik Hamoen |
Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALP ![In: Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 2-4, 1992, Proceedings, pp. 244-258, 1992, Springer, 3-540-55873-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
33 | Andreas Goerdt |
Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings, pp. 329-338, 1988, Springer, 3-540-50110-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
33 | David Harel |
Arithmetical Completeness in Logics of Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings, pp. 268-288, 1978, Springer, 3-540-08860-1. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
33 | Robert Anderson, W. W. Bledsoe |
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 17(3), pp. 525-534, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
|
33 | Isabella Mastroeni |
Deriving Bisimulations by Simplifying Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 9th International Conference, VMCAI 2008, San Francisco, USA, January 7-9, 2008, Proceedings, pp. 157-171, 2008, Springer, 978-3-540-78162-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari |
Making abstract interpretations complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(2), pp. 361-416, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Rob J. van Glabbeek |
Axiomatizing Flat Iteration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '97: Concurrency Theory, 8th International Conference, Warsaw, Poland, July 1-4, 1997, Proceedings, pp. 228-242, 1997, Springer, 3-540-63141-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | V. S. Subrahmanian |
Query Processing in Quantitative Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings, pp. 81-100, 1988, Springer, 3-540-19343-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Wenfei Fan, Floris Geerts |
Relative information completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2009, June 19 - July 1, 2009, Providence, Rhode Island, USA, pp. 97-106, 2009, ACM, 978-1-60558-553-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
information completeness, master data, constraints, consistency |
28 | Philippe Balbiani |
Axiomatization and Completeness of Lexicographic Products of Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FroCoS ![In: Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, Trento, Italy, September 16-18, 2009. Proceedings, pp. 165-180, 2009, Springer, 978-3-642-04221-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
lexicographic product, axiomatization/completeness, Modal logic |
28 | Tommaso Flaminio |
Strong non-standard completeness for fuzzy logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 12(4), pp. 321-333, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Non-standard completeness, Ultraproduct construction, Fuzzy events, Conditional probability |
28 | Van Hung Le 0001, Fei Liu 0003, Dinh Khang Tran |
Fixpoint Semantics and Completeness of the Computational Model for Fuzzy Linguistic Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 420-429, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hedge algebra, linguistic value, completeness, fuzzy logic programming, fixpoint semantics, linguistic hedge |
28 | Jan Kodovský, Jessica J. Fridrich |
On completeness of feature spaces in blind steganalysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MM&Sec ![In: Proceedings of the 10th workshop on Multimedia & Security, MM&Sec 2008, Oxford, UK, September 22-23, 2008, pp. 123-132, 2008, ACM, 978-1-60558-058-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
fcm, steganography, completeness, blind steganalysis |
28 | Torben Braüner |
Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 81(2), pp. 191-226, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Modal logic, hybrid logic, natural deduction, functional completeness |
28 | Rana Barua |
Completeness of a combination of neighbourhood logic and temporal logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Aspects Comput. ![In: Formal Aspects Comput. 16(2), pp. 96-103, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Neighbourhood logic, Completeness, Possible world semantics, Interval logic, First-order temporal logic |
28 | Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen |
Completeness in two-party secure computation: a computational view. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 252-261, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
oblivious tansfer, completeness, secure computation |
28 | Xiuzhen Cheng 0001, Bhagirath Narahari, Rahul Simha, Maggie Xiaoyan Cheng, Dan Liu |
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 2(3), pp. 248-256, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Minimum energy topology, incremental power heuristic, wireless sensor networks, NP-Completeness, power control |
28 | Alexander L. Chistov, Hervé Fournier, Leonid Gurvits, Pascal Koiran |
Vandermonde Matrices, NP-Completeness, and Transversal Subspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 3(4), pp. 421-427, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Vandermonde Matrices, Transversal Subspaces, NP-Completeness |
28 | Grigori Mints, Darko Sarenac |
Completeness of indexed epsilon-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 42(7), pp. 617-625, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Epsilon calculus, Finite choice, Completeness |
28 | Nancy G. Leveson |
Completeness in formal specification language design for process-control systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMSP ![In: Proceedings of the Third Workshop on Formal Methods in Software Practice, 2000, Portland, Oregon, USA, pp. 75-87, 2000, ACM, 1-58113-262-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
completeness, process-control, Formal specification language |
28 | James Laird |
Finite Models and Full Completeness. ![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. 384-398, 2000, Springer, 3-540-67895-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
affine logic, full completeness, effective presentability, linear logic, PCF |
28 | Jack Jie Dai, Jack H. Lutz |
Query Order and NP-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 142-148, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
query order, resource-bounded genericity, computational complexity, NP-completeness, complexity classes, resource-bounded measure |
28 | Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens |
On the completeness of object-creating database transformation languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 44(2), pp. 272-319, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
computational completeness, constructive transformation, while loop, object-oriented database, first-order logic, object creation |
28 | Mats Per Erik Heimdahl, Nancy G. Leveson |
Completeness and Consistency in Hierarchical State-Based Requirements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 22(6), pp. 363-377, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
state-based requirements, formal methods, static analysis, consistency, Completeness, reactive systems, formal semantics |
28 | Mats Per Erik Heimdahl, Barbara J. Czerny |
Using PVS to analyze hierarchical state-based requirements for completeness and consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HASE ![In: 1st High-Assurance Systems Engineering Workshop (HASE '96), October 22, 1996, Niagara, Canada, Proceedings, pp. 252-262, 1996, IEEE Computer Society, 0-8186-7629-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
hierarchical state based requirements specifications, input sequence, analysis procedures, large real world requirements specification, hierarchical state based language, Requirements State Machine Language, Prototype Verification System, theorem proving component, spurious error reports, formal specifications, robustness, consistency, program verification, completeness, Binary Decision Diagrams, BDDs, PVS, interactive environment, formal proofs, RSML |
28 | Boris A. Romov |
Polynomial Completeness Criteria in Finite Boolean Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 26th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1996, Santiago de Compostela, Spain, May 29-31, 1996, Proceedings, pp. 262-266, 1996, IEEE Computer Society, 0-8186-7392-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
completeness criteria, finite Boolean algebras, arity-calibrated product, two-valued logic algebras, maximal subalgebras, Sheffer criterion, Slupecki type criterion, multiple base relation, logic algebras, process algebra, polynomials, algebra, Boolean algebra |
28 | Pankaj Jalote |
Testing the Completeness of Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(5), pp. 526-531, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
completeness testing, VAX system, data structures, Unix, program testing, conformance testing, abstract data types, test cases, axiomatic specifications |
28 | Donald A. Varvel, Leonard D. Shapiro |
The Computational Completeness of Extended Database Query Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(5), pp. 632-638, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
computational completeness, extended database query languages, POSTGRES, GENESIS, Turing machine interpreter, traditional database languages, programming language, database management systems, query languages, computational power |
28 | Sergei G. Vorobyov |
A structural completeness theorem for a class of conditional rewrite rule systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Conference on Computer Logic ![In: COLOG-88, International Conference on Computer Logic, Tallinn, USSR, December 1988, Proceedings, pp. 313-326, 1988, Springer, 3-540-52335-9. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
conditional rewrite rules, case splitting, finite termination, reduction, inference rules, confluency, proof search, decision algorithms, strong completeness |
28 | Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan |
Further Results on Insertion-Deletion Systems with One-Sided Contexts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers, pp. 333-344, 2008, Springer, 978-3-540-88281-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Insertion-deletion systems, computational non-completeness, universality |
28 | Roberto Giacobazzi, Isabella Mastroeni |
Adjoining Declassification and Attack Models by Abstract Interpretation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESOP ![In: Programming Languages and Systems, 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings, pp. 295-310, 2005, Springer, 3-540-25435-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
abstract non-interference, Abstract interpretation, completeness, language-based security, declassification, adjunction, attack models |
28 | Lothar Rogge |
Call Completeness Implies Completeness in the n -period Model of a Financial Market. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finance Stochastics ![In: Finance Stochastics 10(2), pp. 298-301, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
JEL Classifications C60, G10 |
28 | Roald Lengu, Paolo Missier, Alvaro A. A. Fernandes, Giovanna Guerrini, Marco Mesiti |
Time-completeness trade-offs in record linkage using adaptive query processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2009, 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, March 24-26, 2009, Proceedings, pp. 851-861, 2009, ACM, 978-1-60558-422-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Dikran Dikranjan, Elena Martín Peinador, Vaja Tarieladze |
Conway's Question: The Chase for Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 15(5-6), pp. 511-539, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) Primary 22A05, 22B05, 54D25, 54H11, Secondary 54A35, 54D30, 54H13, 54B30 |
28 | Kohei Honda 0001, Martin Berger 0001, Nobuko Yoshida |
Descriptive and Relative Completeness of Logics for Higher-Order Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, pp. 360-371, 2006, Springer, 3-540-35907-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Leslie G. Valiant |
Completeness for Parity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 1-8, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Mircea Marin, Aart Middeldorp |
New completeness results for lazy conditional narrowing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 24-26 August 2004, Verona, Italy, pp. 120-131, 2004, ACM, 1-58113-819-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
conditional rewriting, narrowing, evaluation strategies |
28 | Mohamed G. Gouda, Alex X. Liu |
Firewall Design: Consistency, Completeness, and Compactness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 24th International Conference on Distributed Computing Systems (ICDCS 2004), 24-26 March 2004, Hachioji, Tokyo, Japan, pp. 320-327, 2004, IEEE Computer Society, 0-7695-2086-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Miquel Bofill, Albert Rubio |
Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings, pp. 456-470, 2002, Springer, 3-540-43931-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 5530 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|