F-logic - PDFSEARCH.IO - Document Search Engine

F-logic
Results: 483

#	Item
201	A General Framework for Expressing Preferences in Causal Reasoning and Planning Torsten Schaub∗ Institut f¨ur Informatik Universit¨at Potsdam Postfach Add to Reading List Source URL: www.cs.sfu.ca Language: English - Date: 2006-11-29 16:27:00 Logic in computer science Theoretical computer science Decision theory Linear temporal logic Temporal logic Preference Planning Domain Definition Language Fluent Utility Logic Automated planning and scheduling Mathematical logic
202	A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning Torsten Schaub∗ Institut f¨ur Informatik Universit¨at Potsdam Postfach Add to Reading List Source URL: www.cs.sfu.ca Language: English - Date: 2004-05-13 13:21:07 Non-classical logic Knowledge Reasoning Knowledge representation Consumer theory Default logic Preference Non-monotonic logic Stable model semantics Logic Science Logic programming
203	The Arbitrariness of Variable Names Are the following two programs equavalent? (define (f x) (+ x 1)) (fdefine (f y) (+ y 1)) Add to Reading List Source URL: www.cs.utah.edu Language: English - Date: 2009-02-04 16:35:18 Lambda calculus Variables Predicate logic Data types Free variables and bound variables Function Combinatory logic Mathematics Software engineering Elementary mathematics
204	The Intelligence Crafter: a Fuzzy State Machine Builder Program by F. Martin McNeill Fuzzy Systems Engineering Add to Reading List Source URL: www.foretrade.com Language: English - Date: 2009-09-24 09:59:32 Digital electronics Control engineering Fuzzy control system Finite-state machine State Fuzzy logic Models of computation Logic
205	A better future for comprehensions Dave Herman [for (x of y) if (p(x)) f(x)] (for (x of y) if (p(x)) f(x)) Add to Reading List Source URL: esdiscuss.org Language: English Lambda calculus Punctuation Vertical bar Combinatory logic Language Integrated Query Generator Constructible universe List comprehension Computing Software engineering Computer programming
206	The Ackermann Award 2011 Report of the Jury The seventh Ackermann Award will be presented at this CSL’11, held in Bergen, Norway. This is the ﬁfth year the EACSL Ackermann Award is generously sponsored. Our sponsor f Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Computational complexity theory Finite model theory Circuit complexity Clique problem Clique Wilhelm Ackermann Logic Switching lemma Descriptive complexity theory Theoretical computer science Mathematics Applied mathematics
207	Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder (Extended Abstract)? Jasmin Christian Blanchette and Tobias Nipkow Fakult¨at f¨ur Informatik, T. U. M¨unchen, Garching, Ger Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2010-04-01 08:28:46 Programming paradigms Formal methods Mathematical proofs Lambda calculus Function Well-formed formula Constructible universe Logic programming Relational model Mathematics Logic Mathematical logic
208	Automatic Proof and Disproof in Isabelle/HOL Jasmin Christian Blanchette, Lukas Bulwahn, and Tobias Nipkow Fakult¨at f¨ur Informatik, Technische Universit¨at M¨unchen Abstract. Isabelle/HOL is a popular interactive t Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2011-09-06 10:36:13 Logic in computer science Formal methods Automated theorem proving Isabelle Proof assistant Vampire Curry ACL2 HOL Theoretical computer science Mathematics Applied mathematics
209	The GSAS Bulletin h a r v a r d g r a d u a t e s c h o o l o f a r t s an d s c i e n c e s N o v e m b e rV o l u m e X L I , no . 3 “Knowledge comes, but wisdom lingers.” —Alfred Lord Tennyson Add to Reading List Source URL: gsas.harvard.edu Language: English - Date: 2012-03-19 12:47:03 Fordham Graduate School of Arts and Sciences Dudley House Analytic philosophy Meaning Doctor of Philosophy Logic Linguistics Harvard Graduate School of Arts and Sciences Harvard University Ivy League New England Association of Schools and Colleges
210	Helly’s Intersection Theorem The main topic of this chapter is a famous combinatorial theorem by E. Helly (1884–Let us start with a useful terminology. Definition 0.1. Let F be a family of subsets of a set X, Add to Reading List Source URL: users.mat.unimi.it Language: English - Date: 2010-05-07 05:19:24 General topology Spectral theory Convex analysis Combinatory logic Lambda calculus Logic in computer science Compact space Convex function Spectral theory of ordinary differential equations Topology Mathematics Mathematical analysis

UPDATE