| |
Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Mathematical Logic (F.4.1) > Computational Logic (F.4.1...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 31
Reviews about "Computational Logic (F.4.1...)":
|
Date Reviewed |
| |
On the parameterized complexity of associative and commutative unification
Akutsu T., Jansson J., Takasu A., Tamura T. Theoretical Computer Science 660(C): 57-74, 2017. Type: Article
Equational unification and matching play an important role in theorem proving, term rewriting, and declarative programming. Given a set of axioms and two terms, equational unification asks whether the terms can be made equal by variabl...
|
Jun 28 2018 |
| |
An observationally complete program logic for imperative higher-order functions
Honda K., Yoshida N., Berger M. Theoretical Computer Science 51775-101, 2014. Type: Article
In some programming languages, variables may refer to procedures; these references may be read to call the procedures and updated to refer to new procedures. If the procedures are recursive, it has been unknown whether there exists any...
|
Apr 13 2015 |
| |
Computational logic and human thinking: how to be artificially intelligent
Kowalski R., Cambridge University Press, New York, NY, 2011. 332 pp. Type: Book (978-0-521123-36-5)
Computational thinking is a relatively new approach to education, centered on problem solving as well as system design and analysis based on the paradigms of computer science [1]. By stressing computational thinking at all levels of ed...
|
Jul 10 2012 |
| |
Optimal length tree-like resolution refutations for 2SAT formulas
Subramani K. ACM Transactions on Computational Logic 5(2): 316-320, 2004. Type: Article
It is a well-known fact that propositional formulas in clause form (CNF formulas) with two literals per clause can be checked for satisfiability in polynomial time; that is, the problem 2-SAT is in P, while the problem k
|
May 14 2004 |
| |
Mutilated chessboard problem is exponentially hard for resolution
Alekhnovich M. Theoretical Computer Science 310(1-3): 513-525, 2004. Type: Article
Simple problems that resist routine logic tempt one to waste time. Often, a clever idea makes a result obvious, but a formal proof takes time and space....
|
Apr 1 2004 |
| |
Two-sorted metric temporal logics
Montanari A., de Rijke M. (ed) Theoretical Computer Science 183(2): 187-214, 1997. Type: Article
In real-time systems, one needs to reason about statements like “within five minutes, &phgr; will be true.” Metric tense logics extend tense logic by formulas, like ⋄≤ 5 &...
|
Nov 1 1998 |
| |
Interactive theorem proving with temporal logic
Felty A., Théry L. Journal of Symbolic Computation 23(4): 367-397, 1997. Type: Article
One way to improve software reliability is to use formal methods, which emphasize the design and implementation of provably correct programs and algorithms. However, tackling real applications requires powerful environments that assist...
|
Apr 1 1998 |
| |
A general adequacy result for a linear functional language
Braüner T. Theoretical Computer Science 177(1): 27-58, 1997. Type: Article
The semantics of a linear functional language with a fixed-point constant is examined. This functional language is induced by a Curry-Howard interpretation of intuitionistic linear logic extended with recursion, and it can be viewed as...
|
Apr 1 1998 |
| |
On the expressive power of counting
Grumbach S., Tollu C. Theoretical Computer Science 149(1): 67-99, 1995. Type: Article
Grumbach and Tollu study the effect of adding counting primitives to first-order logic, fixpoint logic, and infinitary logic with a finite number of variables. Such counting extensions are an important topic in finite model theory, whi...
|
Sep 1 1996 |
| |
Philosophical foundations of deontic logic and the logic of defeasible conditionals
Alchourrón C., John Wiley & Sons, Inc., New York, NY, 1994. Type: Book (9780471937432)
Most of the papers in this collection are from the First International Workshop on Deontic Logic in Computer Science, DEON91, held in Amsterdam in December 1991. The artificial intelligence (especially AI and law, and knowledge represe...
|
Feb 1 1996 |
| |
|
|
| |
|
|
