language:
Find link is a tool written by Edward Betts.Longer titles found: ACM Transactions on Computational Logic (view), European Master Program in Computational Logic (view), European PhD Program in Computational Logic (view)
searching for Computational logic 166 found (212 total)
alternate case: computational logic
ACL2
(491 words)
[view diff]
case mismatch in snippet
view article
find links to article
ACL2 (A Computational Logic for Applicative Common Lisp) is a software system consisting of a programming language, an extensible theory in a first-orderJ Strother Moore (457 words) [view diff] exact match in snippet view article find links to article
Institute of Technology in 1970 and his Doctor of Philosophy (Ph.D.) in computational logic at the University of Edinburgh in Scotland in 1973. In addition,Selmer Bringsjord (517 words) [view diff] exact match in snippet view article find links to article
science, and in collaboratively building AI systems on the basis of computational logic. Bringsjord believes that "the human mind will forever be superiorInformation Processing Letters (520 words) [view diff] exact match in snippet view article find links to article
algorithms, formal languages and automata, computational complexity, computational logic, distributed and parallel algorithms, computational geometry, learningLuís Moniz Pereira (197 words) [view diff] case mismatch in snippet view article find links to article
Science, Applied Logic, Electronic Transactions on AI, and of the Computational Logic Newsletter. He is also advisory editor of the International JournalRobert S. Boyer (225 words) [view diff] case mismatch in snippet view article find links to article
Boyer has published extensively, including the following books: A Computational Logic Handbook, with J S. Moore. Second Edition. Academic Press, LondonKeith Clark (computer scientist) (996 words) [view diff] case mismatch in snippet view article
the logic programming group. From 1987 to 2009 he was Professor of Computational Logic at Imperial College. Clark's key contributions have been in the fieldPointer machine (1,556 words) [view diff] case mismatch in snippet view article find links to article
State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, vol. 1, no. 1, (July 2000), pages 77–111. In a single sentence GurevichLogic for Programming, Artificial Intelligence and Reasoning (243 words) [view diff] exact match in snippet view article find links to article
discussing cutting-edge results in the fields of automated reasoning, computational logic, programming languages and their applications. It grew out of theTaxonomy (3,245 words) [view diff] case mismatch in snippet view article find links to article
and John-Jules Charles Meyer. (2005). "Contextual Taxonomies" in Computational Logic in Multi-Agent Systems, pp. 33–51[dead link]. Kenneth Boulding; EliasExperimental Mathematics (journal) (631 words) [view diff] case mismatch in snippet view article
Reasoning and Mathematical Practice. Computational Logic: Proceedings of the NATO Advanced Study Institute on Computational Logic, Held in Marktoberdorf, GermanyComputational mathematics (538 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraList of logic journals (712 words) [view diff] case mismatch in snippet view article find links to article
Theory and Practice of Logic Programming, 2001 ff. Transactions on Computational Logic, ACM 2000 ff. Zeitschrift für allgemeine Wissenschaftstheorie, WiesbadenMathematical software (531 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraJoe Z. Tsien (2,946 words) [view diff] exact match in snippet view article find links to article
validation from multiple experiments. The discovery of this basic computational logic of the brain can have important implications for the development2APL (734 words) [view diff] case mismatch in snippet view article find links to article
and Multi-Agent Systems (JAAMAS), 16(3):214-248, Special Issue on Computational Logic-based Agents, (eds.) Francesca Toni and Jamal Bentahar, 2008. MehdiDov Gabbay (716 words) [view diff] case mismatch in snippet view article find links to article
founder, and joint President of the International Federation of Computational Logic. He is also one of the four founders and council member for manyOperator algebra (545 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraMilitary taxonomy (1,055 words) [view diff] case mismatch in snippet view article find links to article
and John-Jules Charles Meyer. (2005). "Contextual Taxonomies" in Computational Logic in Multi-Agent Systems, pp. 33-51[dead link]. Downie, Richard D.Moshe Vardi (1,188 words) [view diff] case mismatch in snippet view article find links to article
needed] and was formerly a director of the International Federation of Computational Logic Ltd. He has also co-chaired the Association for Computing MachineryAlessandra Russo (316 words) [view diff] case mismatch in snippet view article find links to article
Alessandra Russo is a professor in Applied Computational Logic at the Department of Computing, Imperial College London. She obtained a Laurea in ComputerMartin Davis (mathematician) (1,297 words) [view diff] case mismatch in snippet view article
berkeley.edu. Retrieved January 8, 2023. Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Outstanding Contributions to LogicBernard Meltzer (computer scientist) (400 words) [view diff] case mismatch in snippet view article
was on automatic proof methods. In 1972 he received the chair of Computational Logic (corresponding to the name of the new department, which succeededPoisson algebra (688 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraGeometric analysis (473 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraSociété de Mathématiques Appliquées et Industrielles (364 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraJapan Society for Industrial and Applied Mathematics (259 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraStatistical field theory (479 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraHigher-order logic (1,061 words) [view diff] case mismatch in snippet view article find links to article
Woods, John (eds.). Handbook of the History of Logic, Volume 9: Computational Logic. Elsevier. ISBN 978-0-08-093067-1. Andrews, Peter B, Church's TypeAutomated theorem proving (2,891 words) [view diff] exact match in snippet view article find links to article
"Synthesis of programs in computational logic". In M. Bruynooghe and K.-K. Lau (ed.). Program Development in Computational Logic. LNCS. Vol. 3049. SpringerInternational Council for Industrial and Applied Mathematics (801 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraDefeasible logic (162 words) [view diff] case mismatch 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 eProgram synthesis (2,583 words) [view diff] exact match in snippet view article find links to article
"Synthesis of programs in computational logic". In M. Bruynooghe and K.-K. Lau (ed.). Program Development in Computational Logic. LNCS. Vol. 3049. SpringerStochastic calculus (533 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraValidated numerics (1,339 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraAlvey (543 words) [view diff] case mismatch in snippet view article find links to article
Press. 1989. ISBN 0-262-15038-7. Kakas, A. C.; Sadri, F. (2003). Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. KowalskiMulti-Agent Programming Contest (567 words) [view diff] case mismatch in snippet view article find links to article
GOAL programming language. Toni, Francesca; Torroni, Paolo (Eds.): Computational Logic in Multi-Agent Systems. 6th International Workshop, CLIMA VI 2005Logical Methods in Computer Science (271 words) [view diff] case mismatch in snippet view article find links to article
journal was initially published by the International Federation for Computational Logic, and then by a dedicated non-profit. It moved to the Épisciences [fr]Yuri Gurevich (843 words) [view diff] case mismatch in snippet view article find links to article
State Machines capture sequential algorithms. ACM Transactions on Computational Logic 1(1), 2000. N. Dershowitz and Y. Gurevich. A natural axiomatizationApplied mathematics (2,163 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraSupersymmetry algebra (726 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraSuperalgebra (1,463 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraAlgebra of physical space (1,429 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraAlma-0 (598 words) [view diff] case mismatch in snippet view article find links to article
(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.359529Effective field theory (1,478 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraNumerical methods for partial differential equations (1,937 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraNqthm (847 words) [view diff] case mismatch in snippet view article find links to article
unproductive tendency to wander down infinite chains of inductive proofs. A Computational Logic Handbook, R.S. Boyer and J S. Moore, Academic Press (2nd Edition)Automated reasoning (1,352 words) [view diff] case mismatch in snippet view article find links to article
Wrightson (eds.). Automation of Reasoning (1) — Classical Papers on Computational Logic 1957–1966. Heidelberg: Springer. pp. 1–28. ISBN 978-3-642-81954-4Potential theory (1,322 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraDis-unification (357 words) [view diff] case mismatch in snippet view article find links to article
"Disunification: A Survey". In Jean-Louis Lassez; Gordon Plotkin (eds.). Computational Logic — Essays in Honor of Alan Robinson. MIT Press. pp. 322–359. HubertDepartment of Computer Science and Technology, University of Cambridge (1,243 words) [view diff] case mismatch in snippet view article find links to article
Alan Mycroft, Professor of Computing Lawrence Paulson, Professor of Computational Logic Peter Robinson, Professor of Computer Technology Other notable staffFree University of Bozen-Bolzano (1,450 words) [view diff] case mismatch in snippet view article find links to article
university, under Erasmus Mundus Programme: European Master Program in Computational Logic European Master on Software Engineering Since 2011, there has beenDiscrete mathematics (2,763 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraList of Lisp-family programming languages (562 words) [view diff] case mismatch in snippet view article find links to article
smart-contract abilities ACL2 1990 Robert Boyer, J Moore, Matt Kaufmann A Computational Logic for Applicative Common Lisp consists of a programming language, anInductive programming (2,546 words) [view diff] case mismatch in snippet view article find links to article
Prospects of Program Synthesis". In Kakas, A.; Sadri, F. (eds.). Computational Logic: Logic Programming and Beyond; Essays in Honour of Robert A. KowalskiComputational geometry (2,101 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraGiorgi Japaridze (2,612 words) [view diff] case mismatch in snippet view article find links to article
Transactions on Computational Logic 7 (2006), pages 331-362. G. Japaridze, "Propositional computability logic I". ACM Transactions on Computational Logic 7 (2006)Vector calculus (2,078 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraHigher-order abstract syntax (1,073 words) [view diff] case mismatch in snippet view article find links to article
(2000). Abstract Syntax for Variable Binders: An Overview (PDF). Computational Logic - {CL} 2000. pp. 239–253. Archived from the original (PDF) on 2006-12-02Philippa Gardner (430 words) [view diff] case mismatch in snippet view article find links to article
September 2020. Jean-Louis Lassez; Gordon Plotkin, eds. (1991). Computational Logic — Essays in Honor of Alan Robinson. Cambridge/MA: MIT Press. ISBN 0-262-12156-5Prolog (7,983 words) [view diff] case mismatch in snippet view article find links to article
Intelligence: 27–140. CiteSeerX 10.1.1.56.7278. Sterling, Leon (2002). Computational Logic: Logic Programming and Beyond. Vol. 2407. pp. 17–26. doi:10.1007/3-540-45628-7_15Perturbation theory (2,904 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraDecision theory (3,129 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraProbability theory (3,614 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraApproximation theory (2,162 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraProof assistant (1,152 words) [view diff] case mismatch in snippet view article find links to article
on 10 April 2022. Retrieved 15 February 2024. (By Frank Pfenning). DMOZ: Science: Math: Logic and Foundations: Computational Logic: Logical FrameworksSocial choice theory (2,790 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraValentin Goranko (459 words) [view diff] case mismatch in snippet view article find links to article
on the journal Logics Associate Editor of the ACM Transactions on Computational Logic and member of the editorial boards of several other scientific journalsAbstract state machine (1,163 words) [view diff] case mismatch in snippet view article find links to article
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, JavaNumerical linear algebra (2,463 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraFlora-2 (792 words) [view diff] case mismatch in snippet view article find links to article
Efficient DOOD System Using a Tabling Logic Engine. Intl. Conference on Computational Logic, July 2000. G. Yang, Michael Kifer, and C. Zhao (2003), FLORA-2:Abductive logic programming (2,515 words) [view diff] case mismatch in snippet view article find links to article
"Abduction in Logic Programming". In Kakas, A.C.; Sadri, F. (eds.). Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. KowalskiGeometric calculus (3,026 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraMultivariable calculus (2,284 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraWeak Büchi automaton (294 words) [view diff] case mismatch 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.Mathematical analysis (4,366 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraSasikanth Manipatruni (6,656 words) [view diff] no match in snippet view article find links to article
Sasikanth Manipatruni is an American engineer and inventor in the fields of Computer engineering, Integrated circuit technology, Materials EngineeringParticle physics and representation theory (2,651 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraGlobal optimization (2,092 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraFormal methods (3,608 words) [view diff] case mismatch in snippet view article find links to article
methods and notations available. Abstract State Machines (ASMs) A Computational Logic for Applicative Common Lisp (ACL2) Actor model Alloy ANSI/ISO C SpecificationTopological quantum field theory (3,645 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraDepartment of Computing, Imperial College London (2,351 words) [view diff] case mismatch in snippet view article find links to article
(Professor of AI & Neuroscience) Alessandra Russo (Professor of Applied Computational Logic) Alessio Lomuscio (Professor of Safe Artificial Intelligence) AnthonyAlgorithm (15,311 words) [view diff] case mismatch in snippet view article find links to article
State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, Vol 1, no 1 (July 2000), pp. 77–111. Includes bibliography of 33Problem solving (9,945 words) [view diff] exact match in snippet view article find links to article
advocated logic for both computer and human problem solving and computational logic to improve human thinking. When products or processes fail, problemAutomata theory (3,802 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraCoding theory (3,538 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraWalter Carnielli (1,106 words) [view diff] case mismatch in snippet view article find links to article
(with P. A. S. Veloso). Ultrafilter logic and generic reasoning. In Computational Logic and Proof Theory (Vienna, 1997), pp. 34–53, Lecture Notes in ComputerTermination analysis (1,711 words) [view diff] case mismatch in snippet view article find links to article
"Criteria for Termination". In S. Hölldobler (ed.). Intellectics and Computational Logic (postscript). Dordrecht: Kluwer Academic Publishers. pp. 361–386Grigori Tseitin (313 words) [view diff] case mismatch in snippet view article find links to article
Wrightson, editors, Automation of Reasoning 2: Classical Papers on Computational Logic 1967–1970, S. 466–483. Berlin, Heidelberg, 1983. A. van WijngaardenThe Unreasonable Effectiveness of Mathematics in the Natural Sciences (2,070 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraBelief–desire–intention software model (2,097 words) [view diff] case mismatch in snippet view article find links to article
Fallah-Seghrouchni; Henry Soldano (2004). "Learning in BDI Multi-agent Systems". Computational Logic in Multi-Agent Systems. Lecture Notes in Computer Science. Vol. 3259FO(.) (387 words) [view diff] case mismatch in snippet view article
classical logic with inductive definitions". International Conference on Computational Logic: 703–717. arXiv:cs/0003019. Bibcode:2000cs........3019D. "IDP-Z3"Classical field theory (3,654 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraAlan Bundy (796 words) [view diff] case mismatch in snippet view article find links to article
the 'Metamathematics' Unit, which in 1972 became the Department of Computational Logic, in 1974 was absorbed into the new Department of Artificial IntelligenceCantor's theorem (3,301 words) [view diff] case mismatch in snippet view article find links to article
ISBN 978-1-4614-8854-5. Lawrence Paulson (1992). Set Theory as a Computational Logic (PDF). University of Cambridge Computer Laboratory. p. 14. GrahamMathematical physics (5,146 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraFolkman graph (1,372 words) [view diff] case mismatch in snippet view article find links to article
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 ConderMelvin Fitting (316 words) [view diff] case mismatch in snippet view article find links to article
ISBN 978-1-4612-7515-2. Lassez, Jean-Louis; Plotkin, Gordon (1991). Computational Logic — Essays in Honor of Alan Robinson. Cambridge, Massachusetts: MITSupersymmetric quantum mechanics (2,865 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraFinite-state machine (4,540 words) [view diff] case mismatch in snippet view article find links to article
Machines Capture Sequential Algorithms" (PDF). ACM Transactions on Computational Logic. 1 (1): 77–111. CiteSeerX 10.1.1.146.3017. doi:10.1145/343369.343384Field (physics) (3,952 words) [view diff] exact match in snippet view article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraStephen T. Hedetniemi (280 words) [view diff] case mismatch in snippet view article find links to article
communication sciences in 1966 with Frank Harary. He was in the Computational Logic Group at the University of Michigan and became assistant professorHatfield College, Durham (9,076 words) [view diff] case mismatch in snippet view article find links to article
academia, names include computer scientist Keith Clark, Professor of Computational Logic at Imperial College London (1987–2009); particle physicist NigelKnuth–Bendix completion algorithm (2,301 words) [view diff] case mismatch in snippet view article find links to article
Schwartz; Domenico Cantone; Eugenio G. Omodeo; Martin Davis (2011). Computational Logic and Set Theory: Applying Formalized Logic to Analysis. Springer ScienceConstraint satisfaction problem (2,604 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraTopological string theory (2,689 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraFirst-order logic (13,173 words) [view diff] case mismatch in snippet view article find links to article
see Model checking § First-order logic. Philosophy portal ACL2 — A Computational Logic for Applicative Common Lisp Aristotelian logic Equiconsistency Ehrenfeucht-FraisseMathematical sociology (5,063 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraInformation and computer science (1,534 words) [view diff] exact match in snippet view article find links to article
range of areas from basic computer science theory (algorithms and computational logic) to in depth analysis of data manipulation and use within technologyInductive logic programming (4,137 words) [view diff] exact match in snippet view article find links to article
University. 192. Reprinted in Lassez, J.-L.; Plotkin, G., eds. (1991). Computational logic : essays in honor of Alan Robinson. MIT Press. pp. 199–254. ISBN 978-0-262-12156-9Jean-Pierre Jouannaud (615 words) [view diff] case mismatch in snippet view article find links to article
record at WorldCat Jean-Louis Lassez; Gordon Plotkin, eds. (1991). Computational Logic — Essays in Honor of Alan Robinson. Cambridge/MA: MIT Press. ISBN 978-0-262-12156-9Inductive logic programming (4,137 words) [view diff] exact match in snippet view article find links to article
University. 192. Reprinted in Lassez, J.-L.; Plotkin, G., eds. (1991). Computational logic : essays in honor of Alan Robinson. MIT Press. pp. 199–254. ISBN 978-0-262-12156-9Issue-based information system (3,139 words) [view diff] exact match in snippet view article find links to article
Cao; Torroni, Paolo; Torre, Leon van der; Woltran, Stefan (eds.). Computational logic in multi-agent systems: 14th International Workshop, CLIMA XIV, CoruñaDecidability of first-order theories of the real numbers (495 words) [view diff] case mismatch in snippet view article find links to article
Inequality Constraints over the Real Numbers". ACM Transactions on Computational Logic. 7 (4): 723–748. arXiv:cs/0211016. doi:10.1145/1183278.1183282. S2CID 16781766Jose Meseguer (999 words) [view diff] exact match in snippet view article find links to article
invention and development of rewriting as an expressive and intuitive computational logic and semantic framework for concurrent systems. In particular, theMachine learning (14,186 words) [view diff] case mismatch in snippet view article find links to article
Computer Science, 1981. Reprinted in J.-L. Lassez, G. Plotkin (Eds.), Computational Logic, The MIT Press, Cambridge, MA, 1991, pp. 199–254. Shapiro, Ehud YNumerical methods for ordinary differential equations (3,910 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraUnification (computer science) (7,374 words) [view diff] exact match in snippet view article
321253. S2CID 14389185.; Here: sect.5.8, p.32 J.A. Robinson (1971). "Computational logic: The unification computation". Machine Intelligence. 6: 63–72. DavidClifford analysis (3,393 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraComputability theory (6,430 words) [view diff] case mismatch in snippet view article find links to article
(2014). "Degrees of unsolvability" (PDF). In Siekmann, Jörg H. (ed.). Computational Logic. Handbook of the History of Logic. Vol. 9. Amsterdam: Elsevier/North-HollandHelmut Veith (630 words) [view diff] exact match in snippet view article find links to article
Technology (TU Wien), Austria. Veith received his Diplom-Ingenieur in computational logic at TU Wien in 1994. He received his doctorate in computer scienceGopal Gupta (computer scientist) (426 words) [view diff] exact match in snippet view article
research groups in the Western Hemisphere engaged in research on computational logic. He has been active in research for over 25 years mainly in the fieldPascal Hitzler (1,084 words) [view diff] case mismatch in snippet view article find links to article
he was a postdoctoral researcher at the International Center for Computational Logic at TU Dresden. From 1999 to 2001 he was a PhD student at the DepartmentPhilosophy (18,331 words) [view diff] case mismatch in snippet view article find links to article
Retrieved 6 July 2023. Kakas, Antonis C.; Sadri, Fariba (2003). Computational Logic: Logic Programming and Beyond: Essays in Honour of Robert A. KowalskiSociety for Industrial and Applied Mathematics (2,232 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraConformal field theory (6,361 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraSupersymmetry (7,498 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraGauge theory (6,523 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraString theory (15,312 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraLisp (programming language) (9,664 words) [view diff] case mismatch in snippet view article
Common Lisp has been and continues to be seen worldwide. ACL2 or "A Computational Logic for Applicative Common Lisp", an applicative (side-effect free) variantHamiltonian mechanics (9,275 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraWoody Bledsoe (887 words) [view diff] case mismatch in snippet view article find links to article
ISBN 978-1-56881-205-2. Jean-Louis Lassez; Gordon Plotkin, eds. (1991). Computational Logic — Essays in Honor of Alan Robinson. Cambridge/MA: MIT Press. ISBN 978-0-262-12156-9Weighted automaton (1,613 words) [view diff] case mismatch in snippet view article find links to article
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. ISSN 1529-3785Analytical mechanics (5,759 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraJohn V. Tucker (1,569 words) [view diff] case mismatch in snippet view article find links to article
Abstract computability and algebraic specification, ACM Transactions on Computational Logic, Volume 5 (2004), pp611–668. J A Bergstra and J V Tucker, The rationalDeepak Kapur (1,921 words) [view diff] case mismatch in snippet view article find links to article
(conditional) DAG-based Compact Representations". Italian Conference on Computational Logic: 67–81. Kapur, D.; Narendran, P. (1992-10-01). "Complexity of unificationClifford algebra (8,661 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraHomotopy type theory (4,649 words) [view diff] case mismatch in snippet view article find links to article
coherence construction for dependent type theories". ACM Transactions on Computational Logic. 16 (3): 1–31. arXiv:1411.1736. doi:10.1145/2754931. S2CID 14068103Church–Turing thesis (6,697 words) [view diff] case mismatch in snippet view article find links to article
Machines Capture Sequential Algorithms" (PDF). ACM Transactions on Computational Logic. 1 (1): 77–111. CiteSeerX 10.1.1.146.3017. doi:10.1145/343369.343384Evaluation strategy (5,172 words) [view diff] exact match in snippet view article find links to article
321253. S2CID 14389185.; Here: sect.5.8, p.32 J.A. Robinson (1971). "Computational logic: The unification computation". Machine Intelligence. 6: 63–72. BundyChristoph Walther (1,280 words) [view diff] case mismatch in snippet view article find links to article
"Criteria for Termination". In S. Hölldobler (ed.). Intellectics and Computational Logic. Dordrecht: Kluwer Academic Publishers. pp. 361–386. Christoph Walther;Induction puzzles (6,926 words) [view diff] case mismatch in snippet view article find links to article
a degree of self-awareness". techxplore.com. Leite, João (2005). Computational Logic in Multi-Agent Systems: 5th International Workshop, CLIMA V, LisbonRenormalization group (6,983 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraSpacetime algebra (5,961 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraLagrangian mechanics (12,637 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraStochastic process (17,935 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraLudwig Wittgenstein (22,068 words) [view diff] exact match in snippet view article find links to article
man". The two had many discussions about the relationship between computational logic and everyday notions of truth. Wittgenstein's lectures from thisAlternating timed automaton (1,705 words) [view diff] case mismatch in snippet view article find links to article
Igor (2008). "Alternating Timed Automata". ACM Transactions on Computational Logic. 9 (2): 1–26. arXiv:1208.5909. doi:10.1145/1342991.1342994. S2CID 12319Peter Fox (professor) (1,152 words) [view diff] exact match in snippet view article
data science and analytics, ocean and environmental informatics, computational logic, semantic Web, cognitive bias, semantic data frameworks, and solarCEK Machine (1,845 words) [view diff] case mismatch in snippet view article find links to article
Concrete Framework for Environment Machines". ACM Transactions on Computational Logic. 9 (1). Article #6: 1–30. doi:10.7146/brics.v13i3.21909. RozowskiAnti-unification (2,969 words) [view diff] case mismatch in snippet view article find links to article
Temur (2020). "Idempotent Anti-Unification". ACM Transactions on Computational Logic. 21 (2): 1–32. doi:10.1145/3359060. hdl:10.1145/3359060. S2CID 207861304Krivine machine (1,890 words) [view diff] case mismatch in snippet view article find links to article
Concrete Framework for Environment Machines". ACM Transactions on Computational Logic. 9 (1). Article #6: 1–30. doi:10.7146/brics.v13i3.21909. SwierstraPropositional calculus (15,295 words) [view diff] exact match in snippet view article find links to article
Pressbooks. Dix, J.; Fisher, Michael; Novak, Peter, eds. (2010). Computational logic in multi-agent systems: 10th international workshop, CLIMA X, HamburgHistory of logic (13,242 words) [view diff] case mismatch in snippet view article find links to article
Twentieth century; 8. The many-valued and nonmonotonic turn in logic; 9. Computational Logic; 10. Inductive logic; 11. Logic: A history of its central concepts;Andrzej Grzegorczyk (2,886 words) [view diff] case mismatch in snippet view article find links to article
2016 Niwiński, Damian (2016): Contribution of Warsaw Logicians to Computational Logic. Axioms, Volume 5, Issue 16, 8 pages Golińska-Pilarek, Joanna (2016):Neural Darwinism (7,294 words) [view diff] exact match in snippet view article find links to article
is no point-to-point wiring that carries a neural code through a computational logic circuit that delivers the result to the brain because firstly, theCurry–Howard correspondence (6,197 words) [view diff] exact match in snippet view article find links to article
commentary, in: Automation and Reasoning, vol 2, Classical papers on computational logic 1967–1970, Springer Verlag, 1983, pp. 159–200. Howard, William APerturbation theory (quantum mechanics) (15,890 words) [view diff] exact match in snippet view article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraLogic of graphs (4,975 words) [view diff] case mismatch in snippet view article find links to article
descriptive complexity of subgraph isomorphism", ACM Transactions on Computational Logic, 20 (2): A9:1–A9:18, arXiv:1802.02143, doi:10.1145/3303881, MR 3942556Gauge theory (mathematics) (11,064 words) [view diff] exact match in snippet view article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraDependence logic (4,300 words) [view diff] case mismatch in snippet view article find links to article
Kontinen, Juha, 'Hierarchies in Dependence Logic'. ACM Transactions on Computational Logic, 2012. Enderton, Herbert B. (1970), 'Finite partially-ordered quantifiers'Supersymmetric theory of stochastic dynamics (8,481 words) [view diff] exact match in snippet view article find links to article
Computational geometry Constraint satisfaction Constraint programming Computational logic Cryptography Information theory Statistics Discrete Computer algebraAlgorithm characterizations (8,851 words) [view diff] case mismatch in snippet view article find links to article
State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, Vol 1, no 1 (July 2000), pages 77–111. Includes bibliography ofThe Semantic Turn (4,309 words) [view diff] exact match in snippet view article find links to article
was shaped by rational decision theory and early conceptions of computational logic, hence limited largely to technology-centered design. KrippendorffVasant Honavar (8,139 words) [view diff] case mismatch in snippet view article find links to article
Secrecy-preserving Reasoning in Knowledge Bases". ACM Transactions on Computational Logic. 16: 1–32. doi:10.1145/2637477. S2CID 11436585. Santhanam, G.R.,Refocusing (semantics) (2,745 words) [view diff] case mismatch in snippet view article
Concrete Framework for Environment Machines". ACM Transactions on Computational Logic. 9 (1). Article #6: 1–30. doi:10.7146/brics.v13i3.21909. Biernacka