Results 221 to 230 of about 10,419 (259)

On decision procedures for sentential logics

Studia Logica, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Resolution Decision Procedure for Fluted Logic

2000
Fluted logic is a fragment of first-order logic without function symbols in which the arguments of atomic subformulae form ordered sequences. A consequence of this restriction is that, whereas first-order logic is only semi-decidable, fluted logic is decidable.
Renate A. Schmidt, Ullrich Hustadt
openaire   +1 more source

An extended procedure in quantificational logic

Journal of Symbolic Logic, 1953
The aim of this paper is to present a decision procedure which seems to be as easy to use as other available procedures in quantification theory, but which is considerably stronger than the others, providing a mechanical test for a sub-species of polyadic validity which is very much broader than monadic validity. Of course, a test for polyadic validity
openaire   +2 more sources

The logic of modern retention procedures

American Journal of Orthodontics and Dentofacial Orthopedics, 1988
similar concerns posed the problem of retention or its counterpart-relapse or treatment instability. This article intends to show that the problem has not been satisfactorily answered by the multiplicity of authoritative statements and opinions, nor by clinical and experimental studies made before and during the intervening decades.
openaire   +2 more sources

Unrestricted procedure calls in Hoare's logic

Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78, 1978
This paper presents a new version of Hoare's logic including generalized procedure call and assignment rules which correctly handle aliased variables. Formal justifications are given for the new rules.
Robert Cartwright, Derek C. Oppen
openaire   +1 more source

A proof procedure for adaptive logics

Logic Journal of IGPL, 2012
In this article, I present a procedure that generates proofs for finally derivable adaptive logic consequences. A proof procedure for the inconsistency adaptive logic CLuNr is already presented in [7]. In this article a procedure for CLuNm is presented and the results for both logics are generalized to all adaptive logics, on the presupposition that ...
openaire   +1 more source

A new logic synthesis and optimization procedure

ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196), 2002
The objective of this work is to develop a new logic circuit synthesis and optimization procedure for arbitrary logic function. Following the procedure, we may get a new high performance logic circuit family, which has low power consumption, low power-delay product, area efficiency and suitable for low supply voltage.
Huo-Hsing Cheng, Ven-Chieh Hsieh
openaire   +1 more source

Non-procedural logic programming

1994
We present a logic programming language where both problem domain and computational knowledge are expressed in logic. A logic program in this language consists of an object-program and a number of meta-programs. The object program, a collection of formulae, is a description of the problem domain of interest.
openaire   +1 more source

On transformation of logic specifications into procedural programs

[Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence, 2003
A method for transforming a source program expressed as a set of Horn clauses into a target program in an Algol-like procedural language is presented. Compared with deterministic execution of a conventional program, the top-down procedural interpretation of a Horn clause program is inherently nondeterministic.
Janet M. Lin, Jie-Yong Juang, Stephen S. Yau   +2 more
openaire   +1 more source

Decision procedure for autoepistemic logic

2005
Autoepistemic logic is a nonmonotonic logic for modeling the beliefs of an ideally rational agent who reflects on his own beliefs. Autoepistemic logic has been lacking a decision procedure to answer the question: given a set of premises describing the beliefs of an agent does the agent believe a given formula (is the given formula derivable from the ...
openaire   +1 more source