Sciweavers

2920 search results - page 57 / 584
» Finite information logic
Sort
View
JELIA
1990
Springer
14 years 2 months ago
Action Logic and Pure Induction
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
Vaughan R. Pratt
IJCAI
1989
13 years 11 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
CCIA
2009
Springer
13 years 11 months ago
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Pere Pardo, Pilar Dellunde, Lluis Godo
KBSE
1999
IEEE
14 years 2 months ago
Controlled Natural Language Can Replace First-Order Logic
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem we developed Attem...
Norbert E. Fuchs, Uta Schwertel, Sunna Torge
CSL
2008
Springer
13 years 11 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco