Výsledky vyhledávání - nonnumerical algorithms and (problem OR problemys)—complexity of proof procedures*
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: ISSN: 0925-8531.
Témata: Type-logical grammars, Proof theory, Proof nets, Parsing as deduction, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving/I.2.3.1: Deduction (e.g., natural, rule-based), ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, [INFO]Computer Science [cs]
-
2
Autoři: a další
Přispěvatelé: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783319492582
Témata: [INFO.INFO-DC]Computer Science [cs]/Distributed, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, Parallel, 01 natural sciences, and Cluster Computing [cs.DC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO]Computer Science [cs], ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure
Popis souboru: application/pdf
Přístupová URL adresa: https://link.springer.com/article/10.1007/s00224-017-9828-z
https://hal.archives-ouvertes.fr/hal-01894618
https://doi.org/10.1007/s00224-017-9828-z
https://dblp.uni-trier.de/db/journals/mst/mst63.html#BalabonskiDRTU19
https://rd.springer.com/chapter/10.1007/978-3-319-49259-9_2
https://doi.org/10.1007/978-3-319-49259-9_2
https://hal.archives-ouvertes.fr/hal-01491813
https://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://link.springer.com/chapter/10.1007/978-3-319-49259-9_2
http://dblp.uni-trier.de/db/conf/sss/sss2016.html#BalabonskiDRTU16
https://hal.science/hal-01894618v1/document
https://doi.org/10.1007/s00224-017-9828-z
https://hal.science/hal-01894618v1
https://hal.sorbonne-universite.fr/hal-01491813v1
https://doi.org/10.1007/978-3-319-49259-9_2 -
3
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Algorithms, Theory Additional Key Words and Phrases, Proof complexity, parameterized complexity, Resolution, Prover-Delayer games ACM Reference Format
Popis souboru: application/pdf
-
4
Autoři: a další
Přispěvatelé: a další
Zdroj: CSL 2016 ; https://inria.hal.science/hal-01191172 ; CSL 2016, Sep 2016, Marseille, France. pp.1--16, ⟨10.4230/LIPIcs.CSL.2016.32⟩
Témata: complexity, modal logic, proof systems, XPath, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.5: Modal logic, ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.3: Languages/H.2.3.3: Query languages, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
-
5
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors H.2.3 [Database management systems, Languages— query languages, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Complexity of proof procedures General Terms Algorithms, Theory Keywords XPath, trees, satisfiability
Popis souboru: application/pdf
-
6
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Nonnumerical Algorithms and Problems, Complexity of proof procedures, F.1.3 [Complexity Measures and Classes, Complexity hierarchies, F.4.1 [Mathematical Logic, Mechanical theorem proving, I.2.3 [Deduction and Theorem Proving, Resolution General Terms, Algorithms, Performance Additional Key Words and Phrases, Davis-Putnam, Propositional Satisfiability, NP-Completeness
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.395; http://klase.itc.it/paper_firb_astro_klase/unirm/LiberatoreTOCL06.pdf
-
7
Autoři: a další
Přispěvatelé: a další
Témata: and Protection, D.4.6 [Operating Systems, Security and Protection—Access controls, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms, Security, Theory, Languages Additional Key Words and Phrases, access control, trust management, distributed system security, logic
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4238; http://www.cs.utsa.edu/~winsboro/index_files/Papers/Safety_JACM_AcceptedVersion.pdf
-
8
Autoři: a další
Přispěvatelé: a další
Zdroj: Lecture Notes in Computer Science ISBN: 9783319096971
Témata: ddc:004, Data processing Computer science, Models of Computation (F.4.1), Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), Classes defined by grammars or automata (e.g., context-free languages, regular sets, recursive sets), 0102 computer and information sciences, 02 engineering and technology, Routing and layout, 01 natural sciences, Classes defined by resource-bounded automata, Algebraic language theory, Self-modifying machines (e.g., neural networks), Relations among complexity classes, 0202 electrical engineering, electronic engineering, information engineering, Decision problems, Pattern matching, Complexity of proof procedures, Bounded-action devices (e.g., Turing machines, random access machines), Machine-independent complexity, computational complexity, Automata (e.g., finite, push-down, resource-bounded), Formal Languages (D.3.1), almost-equivalence, 4. Education, Relations between models, hyper-minimization, Computability theory, 16. Peace & justice, Reducibility and completeness, Geometrical problems and computations, Relations among complexity measures, Operations on languages, Computations on discrete structures, Sorting and searching, Sequencing and scheduling, biautomata, Complexity hierarchies, Complexity Measures and Classes (F.2) (REVISED), Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3)
Popis souboru: application/pdf
Přístupová URL adresa: http://geb.uni-giessen.de/geb/volltexte/2014/11056/pdf/Ifig_Report1401.pdf
http://www.informatik.uni-giessen.de/reports/Report1401.pdf
https://link.springer.com/chapter/10.1007/978-3-319-09698-8_26
https://rd.springer.com/chapter/10.1007/978-3-319-09698-8_26
http://geb.uni-giessen.de/geb/volltexte/2014/11056/ -
9
Autoři:
Zdroj: Journal of the ACM; Aug2012, Vol. 59 Issue 4, p1-34, 34p
-
10
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.sorbonne-universite.fr/hal-01348830 ; [Research Report] UPMC - Université Paris 6 Pierre et Marie Curie. 2016.
Témata: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.6: Security and Protection/D.4.6.4: Invasive software (e.g., viruses, worms, Trojan horses), ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.4: Communications Management/D.4.4.3: Network communication, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.2: Storage Management, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
-
11
Autoři:
Přispěvatelé:
Témata: Mathematical Logic—Modal Logic, Computational Logic, F.2.2. [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of Proof Procedures General Terms, Algorithms, Languages, Theory Additional Key Words and Phrases, Shallow models, resolution, coalgebra
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.939; http://tocl.acm.org/accepted/352schroeder.pdf
-
12
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Proof theory, Mechanical theorem proving General Terms, Theory Additional Key Words and Phrases, Arithmetic, deduction modulo, higher-order logic, prooflength speed-ups, term
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.312.3589; http://arxiv.org/pdf/0805.1464v1.pdf
-
13
Autoři:
Přispěvatelé:
Témata: Mathematical Logic—Modal Logic, Computational Logic, F.2.2. [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of Proof Procedures General Terms, Algorithms, Languages, Theory Additional Key Words and Phrases, Shallow models, resolution, coalgebra
Popis souboru: application/pdf
-
14
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors D.4.6 [Operating Systems, Security and Protection—Access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms Security, Theory Keywords Access Control, Fault-tolerant, Policy Design
Popis souboru: application/pdf
-
15
Autoři: a další
Přispěvatelé: a další
Zdroj: International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016) ; https://hal.sorbonne-universite.fr/hal-01491813 ; International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Nov 2016, Lyon, France. pp.7-19, ⟨10.1007/978-3-319-49259-9_2⟩
Témata: ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.5: Reliability/D.4.5.2: Fault-tolerance, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs/F.3.1.3: Mechanical verification, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.3: Studies of Program Constructs/F.3.3.4: Type structure, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
-
16
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, D.4.6 [Operating Systems, Security and Protection—Access controls, F.4.3 [Mathematical Logic And Formal Languages, Formal Languages, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures, K.6.5 [Management of Computing and Information Systems, Security and Protection General Terms, Security, Theory, Verification
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.4211; http://www.cs.purdue.edu/homes/ninghui/papers/algebra_jacm.pdf
-
17
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic--computational logic, lambda calculus and related systems, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems-- complexity of proof procedures General Terms, Theory Additional Key Words and Phrases, elementary recursive functions, complexity, lambda calculus, second order logic
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.5408; http://www.tcs.ifi.lmu.de/~jjohanns/papers/elf.ps.gz
-
18
Autoři: a další
Přispěvatelé: a další
Témata: Categories and Subject Descriptors D.4.6 [Operating Systems, Security and Protection—Access controls, K.6.5 [Management of Computing and Information Systems, Security and Protection, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Complexity of proof procedures General Terms Security, Theory Keywords role-based access control
Popis souboru: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.4355; http://www.cs.purdue.edu/homes/ninghui/papers/sod_ccs04.pdf
-
19
Autoři: a další
Přispěvatelé: a další
Zdroj: https://inria.hal.science/inria-00278186 ; 2008.
Témata: Arithmetic, deduction modulo, higher-order logic, proof-length speed-ups, term rewriting, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.0: Complexity of proof procedures, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.4: Mechanical theorem proving, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
-
20
Autoři:
Přispěvatelé:
Témata: Nonnumerical Algorithms and Problems|complexity of proof procedures General terms, Algorithms, Theory Additional Key Words and Phrases, Data ow frameworks, data ow analysis, bidirectional data ows
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3128; http://www.iitb.ernet.in:8000/~uday/t1271.ps
Nájsť tento článok vo Web of Science 
Full Text Finder