Sciweavers

71 search results - page 7 / 15
» An Abstract Way to Define Rewriting Logic
Sort
View
GG
2010
Springer
13 years 8 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...
CADE
2010
Springer
13 years 8 months ago
Classical Logic with Partial Functions
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...
Hans de Nivelle
KI
2006
Springer
13 years 7 months ago
Agent Logics as Program Logics: Grounding KARO
Abstract. Several options are available to relate agent logics to computational agent systems. Among others, one can try to find useful executable fragments of an agent logic or us...
Koen V. Hindriks, John-Jules Ch. Meyer
ALP
1990
Springer
13 years 11 months ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar
EUSFLAT
2009
120views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
On M-Approximative Operators and M-Approximative Systems
Abstract-- The concept of an M-approximative system is introduced. Basic properties of the category of M-approximative systems and in a natural way defined morphisms between them a...
Alexander P. Sostak