Results 211 to 220 of about 235,856 (255)
Some of the next articles are maybe not open access.
An adaptive fuzzy-logic procedure for ranking logical sensory performance
Proceedings of IEEE Sensors, 2003Multiple sensors are necessary for mobile robot operation in unknown environments. The multitude of sensors must be fused. For reliable fusion it is important to determine the performance of each sensor. A sensor ranking procedure based on an adaptive fuzzy logic algorithm for sensor fusion was developed.
G. Shayer, O. Cohen, Y. Edan, E. Korach
openaire +1 more source
Non-procedural logic programming
1994We 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
Unrestricted procedure calls in Hoare's logic
Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78, 1978This 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 Oppen
openaire +1 more source
1975
Since the Schrodinger equation cannot be solved exactly for polyelectronic systems, one has to look for approximate solutions of any desired accuracy. One way is the use of the variation method [1]. The Eckart theorem shows that any trial wavefunction ΞΎ (which is normalizable) leads to a value of the energy e which is never lower than the true ground ...
openaire +1 more source
Since the Schrodinger equation cannot be solved exactly for polyelectronic systems, one has to look for approximate solutions of any desired accuracy. One way is the use of the variation method [1]. The Eckart theorem shows that any trial wavefunction ΞΎ (which is normalizable) leads to a value of the energy e which is never lower than the true ground ...
openaire +1 more source
Decision Procedures for Guarded Logics
1999Different variants of guarded logics (a powerful generalization of modal logics) are surveyed and the recent decidability result for guarded fixed point logic (obtained in joint work with I. Walukiewicz) is explained. The exposition given here emphasizes the tree model property of guarded logics: every satisfiable sentence has a model of bounded tree ...
openaire +1 more source
Memristor-based IMPLY logic design procedure
2011 IEEE 29th International Conference on Computer Design (ICCD), 2011Memristors can be used as logic gates. No design methodology exists, however, for memristor-based combinatorial logic. In this paper, the design and behavior of a memristive-based logic gate - an IMPLY gate - are presented and design issues such as the tradeoff between speed (fast write times) and correct logic behavior are described, as part of an ...
Shahar Kvatinsky +3 more
openaire +1 more source
Decision procedure for autoepistemic logic
2005Autoepistemic 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
Temporal aspects of logical procedure definition
Information Systems, 1980Abstract This paper discusses the inclusion of time in a message-oriented relational model of information systems in order to achieve memory independent specifications. The concept of memory independence is reviewed and several systems languages are analysed from this point of view and also in other aspects of their temporal properties.
openaire +2 more sources
Real-time temporal logic decision procedures
[1989] Proceedings. Real-Time Systems Symposium, 2003Real-time systems are modeled by a timed transition model (TTM). For any finite-state TTM, decision procedures are provided for checking a small but important class of properties, which are specified in real-time temporal logic. The procedures are linear in the size of the system reachability graph.
openaire +1 more source
An extended procedure in quantificational logic
Journal of Symbolic Logic, 1953The 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

