Sciweavers

1549 search results - page 18 / 310
» On the rules of intermediate logics
Sort
View
RULEML
2010
Springer
13 years 7 months ago
Transformation of SBVR Compliant Business Rules to Executable FCL Rules
 The  main  source  of  changing  requirements  of  the  dynamic  business   environment  is  response  to  changes  in  regulations  and  contracts  towards  ...
Aqueo Kamada, Guido Governatori, Shazia Wasim Sadi...
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 8 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
ISSAC
1990
Springer
83views Mathematics» more  ISSAC 1990»
14 years 26 days ago
Resolution Proof Systems with Weak Transformation Rules
In the previous papers [7-101we defined and explored a formal methodological framework on the basis of which resolution proof systems for strongly-finite logics can be introduced ...
Zbigniew Stachniak
CADE
1992
Springer
14 years 28 days ago
Isabelle-91
e introducing the types and constants of the logic, i.e. its abstract syntax, and axioms describing the inference rules. As a tiny example, consider the following definition of min...
Tobias Nipkow, Lawrence C. Paulson
FUZZIEEE
2007
IEEE
14 years 3 months ago
f-DLPs: Extending Description Logic Programs with Fuzzy Sets and Fuzzy Logic
— The Semantic Web can be viewed as largely about “Knowledge meets the Web”. Thus its vision includes ontologies and rules. A key requirement for the architecture of the Sema...
Tassos Venetis, Giorgos Stoilos, Giorgos B. Stamou...