Results 271 to 280 of about 1,229,738 (330)

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.
Schmidt, R.A., Hustadt, Ullrich
openaire   +1 more source

An adaptive fuzzy-logic procedure for ranking logical sensory performance

Proceedings of IEEE Sensors, 2003
Multiple 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

Combining Logic with Large Language Models for Automatic Debugging and Repair of ASP Programs

arXiv.org
Logic programs are a powerful approach for solving NP-Hard problems. However, due to their declarative nature, debugging logic programs poses significant challenges.
Ricardo Brancas, Vasco M. Manquinho, Ruben Martins   +2 more
semanticscholar   +1 more source

Extension of constraint-procedural logic-generated environments for deep Q-learning agent training and benchmarking

Journal of Logic and Computation, 2023
Giovanni De Gasperis, Stefania Costantini, Andrea Rafanelli, P. Migliarini, Ivan Letteri, Abeer Dyoub   +5 more
semanticscholar   +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, 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 Oppen
openaire   +1 more source

The Logic of SCF Procedures

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

Decision Procedures for Guarded Logics

1999
Different 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), 2011
Memristors 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, Avinoam Kolodny, Uri C. Weiser, Eby G. Friedman   +3 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

Temporal aspects of logical procedure definition

Information Systems, 1980
Abstract 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