Find link

language:

Find link is a tool written by Edward Betts.

searching for ACM Transactions on Computational Logic 27 found (45 total)

alternate case: aCM Transactions on Computational Logic

Pointer machine (1,556 words) [view diff] exact match in snippet view article find links to article

Abstract State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, vol. 1, no. 1, (July 2000), pages 77–111. In a single

Defeasible logic (162 words) [view diff] exact match in snippet view article find links to article

G. Governatori, and M. Maher (2001). Representation results for defeasible logic. ACM Transactions on Computational Logic, 2(2):255–287. v t e v t e

Yuri Gurevich (836 words) [view diff] exact match in snippet view article find links to article

Abstract State Machines capture sequential algorithms. ACM Transactions on Computational Logic 1(1), 2000. N. Dershowitz and Y. Gurevich. A natural axiomatization

Weak Büchi automaton (297 words) [view diff] exact match in snippet view article find links to article

procedure for linear arithmetic over the integers and reals" (PDF). ACM Transactions on Computational Logic. 6 (3): 614–633. doi:10.1145/1071596.1071601.

Valentin Goranko (471 words) [view diff] exact match in snippet view article find links to article

Editor-in-chief on the journal Logics Associate Editor of the ACM Transactions on Computational Logic and member of the editorial boards of several other scientific

Giorgi Japaridze (2,628 words) [view diff] exact match in snippet view article find links to article

II". ACM Transactions on Computational Logic 7 (2006), pages 331-362. G. Japaridze, "Propositional computability logic I". ACM Transactions on Computational

Alma-0 (627 words) [view diff] exact match in snippet view article find links to article

Jean-François (October 2000). "Search and strategies in OPL". ACM Transactions on Computational Logic. 1 (2): 285–320. CiteSeerX 10.1.1.17.836. doi:10.1145/359496

Georg Gottlob (1,048 words) [view diff] exact match in snippet view article find links to article

DLV system for knowledge representation and reasoning". ACM Transactions on Computational Logic. 7 (3): 499. arXiv:cs/0211004. doi:10.1145/1149114.1149117

Abstract state machine (1,166 words) [view diff] exact match in snippet view article find links to article

Abstract State Machines capture Sequential Algorithms, ACM Transactions on Computational Logic 1(1) (July 2000), 77–111. R. Stärk, J. Schmid and E. Börger

Folkman graph (1,392 words) [view diff] exact match in snippet view article find links to article

Szeider, Stefan (2015), "A SAT approach to clique-width", ACM Transactions on Computational Logic, 16 (3): 24:1–24:27, arXiv:1304.5498, doi:10.1145/2736696

Decidability of first-order theories of the real numbers (503 words) [view diff] exact match in snippet view article find links to article

Quantified Inequality Constraints over the Real Numbers". ACM Transactions on Computational Logic. 7 (4): 723–748. arXiv:cs/0211016. doi:10.1145/1183278

John V. Tucker (1,601 words) [view diff] exact match in snippet view article find links to article

Zucker, Abstract computability and algebraic specification, ACM Transactions on Computational Logic, Volume 5 (2004), pp611–668. J A Bergstra and J V Tucker

Weighted automaton (1,685 words) [view diff] exact match in snippet view article find links to article

; Otop, Jan (2017-12-14). "Nested Weighted Automata". ACM Transactions on Computational Logic. 18 (4): 31:1–31:44. arXiv:1504.06117. doi:10.1145/3152769

CEK Machine (1,870 words) [view diff] exact match in snippet view article find links to article

(2007). "A Concrete Framework for Environment Machines". ACM Transactions on Computational Logic. 9 (1). Article #6: 1–30. doi:10.7146/brics.v13i3.21909

Krivine machine (1,911 words) [view diff] exact match in snippet view article find links to article

(2007). "A Concrete Framework for Environment Machines". ACM Transactions on Computational Logic. 9 (1). Article #6: 1–30. doi:10.7146/brics.v13i3.21909

Alternating timed automaton (1,911 words) [view diff] exact match in snippet view article find links to article

Walukiewicz, Igor (2008). "Alternating Timed Automata". ACM Transactions on Computational Logic. 9 (2): 1–26. arXiv:1208.5909. doi:10.1145/1342991.1342994

Finite-state machine (4,533 words) [view diff] exact match in snippet view article find links to article

Abstract State Machines Capture Sequential Algorithms" (PDF). ACM Transactions on Computational Logic. 1 (1): 77–111. CiteSeerX 10.1.1.146.3017. doi:10.1145/343369

Anti-unification (3,058 words) [view diff] exact match in snippet view article find links to article

David; Kutsia, Temur (2020). "Idempotent Anti-Unification". ACM Transactions on Computational Logic. 21 (2): 1–32. doi:10.1145/3359060. hdl:10.1145/3359060

Algorithm (7,010 words) [view diff] exact match in snippet view article find links to article

Abstract State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, Vol 1, no 1 (July 2000), pp. 77–111. Includes bibliography

Web Ontology Language (4,313 words) [view diff] exact match in snippet view article find links to article

(2012). "Complexities of Horn Description Logics" (PDF). ACM Transactions on Computational Logic. 14 (1): 1–36. doi:10.1145/2422085.2422087. Retrieved 23

Homotopy type theory (4,607 words) [view diff] exact match in snippet view article find links to article

overlooked coherence construction for dependent type theories". ACM Transactions on Computational Logic. 16 (3): 1–31. arXiv:1411.1736. doi:10.1145/2754931. S2CID 14068103

Dependence logic (4,500 words) [view diff] exact match in snippet view article find links to article

and Kontinen, Juha, 'Hierarchies in Dependence Logic'. ACM Transactions on Computational Logic, 2012. Enderton, Herbert B. (1970), 'Finite partially-ordered

Logic of graphs (5,029 words) [view diff] exact match in snippet view article find links to article

asymptotic descriptive complexity of subgraph isomorphism", ACM Transactions on Computational Logic, 20 (2): A9:1–A9:18, arXiv:1802.02143, doi:10.1145/3303881

Church–Turing thesis (6,845 words) [view diff] exact match in snippet view article find links to article

Abstract State Machines Capture Sequential Algorithms" (PDF). ACM Transactions on Computational Logic. 1 (1): 77–111. CiteSeerX 10.1.1.146.3017. doi:10.1145/343369

First-order logic (12,947 words) [view diff] exact match in snippet view article find links to article

formally verified proof of the prime number theorem", ACM Transactions on Computational Logic, vol. 9 no. 1 doi:10.1145/1297658.1297660 Barwise, Jon

Refocusing (semantics) (2,786 words) [view diff] exact match in snippet view article

(2007). "A Concrete Framework for Environment Machines". ACM Transactions on Computational Logic. 9 (1). Article #6: 1–30. doi:10.7146/brics.v13i3.21909

Algorithm characterizations (8,991 words) [view diff] exact match in snippet view article find links to article

Abstract State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, Vol 1, no 1 (July 2000), pages 77–111. Includes bibliography