About Declarative Semantics of Logic-Based Agent Languages

2006 ◽  
pp. 106-123 ◽  
Author(s):  
Stefania Costantini ◽  
Arianna Tocchio
Keyword(s):  
Declarative Semantics

scholarly journals Contextual Abductive Reasoning with Side-Effects

2014 ◽  
Vol 14 (4-5) ◽  
pp. 633-648 ◽  
Author(s):  
LUÍS MONIZ PEREIRA ◽  
EMMANUELLE-ANNA DIETZ ◽  
STEFFEN HÖLLDOBLER
Keyword(s):  
Side Effects ◽  
Side Effect ◽  
Contextual Information ◽  
Operational Semantics ◽  
Syllogistic Reasoning ◽  
Abductive Reasoning ◽  
Reasoning Task ◽  
Bias Effect ◽  
Declarative Semantics ◽  
Scope Of Application

AbstractThe belief bias effect is a phenomenon which occurs when we think that we judge an argument based on our reasoning, but are actually influenced by our beliefs and prior knowledge. Evans, Barston and Pollard carried out a psychological syllogistic reasoning task to prove this effect. Participants were asked whether they would accept or reject a given syllogism. We discuss one specific case which is commonly assumed to be believable but which is actually not logically valid. By introducing abnormalities, abduction and background knowledge, we adequately model this case under the weak completion semantics. Our formalization reveals new questions about possible extensions in abductive reasoning. For instance, observations and their explanations might include some relevant prior abductive contextual information concerning some side-effect or leading to a contestable or refutable side-effect. A weaker notion indicates the support of some relevant consequences by a prior abductive context. Yet another definition describes jointly supported relevant consequences, which captures the idea of two observations containing mutually supportive side-effects. Though motivated with and exemplified by the running psychology application, the various new general abductive context definitions are introduced here and given a declarative semantics for the first time, and have a much wider scope of application. Inspection points, a concept introduced by Pereira and Pinto, allows us to express these definitions syntactically and intertwine them into an operational semantics.

An Integrated Approach for the Enforcement of Contextual Permissions and Pre-Obligations

2012 ◽  
pp. 107-126
Author(s):  
Yehia Elrakaiby ◽  
Frédéric Cuppens ◽  
Nora Cuppens-Boulahia
Keyword(s):  
Predicate Logic ◽  
Operational Semantics ◽  
Integrated Approach ◽  
Eca Rules ◽  
Authorization Policy ◽  
Declarative Semantics ◽  
Access Request ◽  
Successful Fulfillment ◽  
Authorization Policies

Pre-obligations denote actions that may be required before access is granted. The successful fulfillment of pre-obligations leads to the authorization of the requested access. Pre-obligations enable a more flexible enforcement of authorization policies. This paper formalizes interactions between the obligation and authorization policy states when pre-obligations are supported and investigates their use in a practical scenario. The main advantage of the presented approach is that it gives pre-obligations both declarative semantics using predicate logic and operational semantics using Event-Condition-Action (ECA) rules. Furthermore, the presented framework enables policy designers to easily choose to evaluate any pre-obligation either (1) statically (an access request is denied if the pre-obligation has not been fulfilled); or (2) dynamically (users are given the possibility to fulfill the pre-obligation after the access request and before access is authorized).

Declarative semantics for active rules

2001 ◽  
Vol 1 (1) ◽  
pp. 43-69 ◽  
Author(s):  
SERGIO FLESCA ◽  
SERGIO GRECO
Keyword(s):  
Active Rules ◽  
Declarative Semantics

Towards a declarative semantics of inheritance with exceptions

1996 ◽  
Vol 11 (1) ◽  
pp. 61-71
Author(s):  
Dianxiang Xu ◽  
Guoliang Zheng
Keyword(s):  
Declarative Semantics

Constraint logic programming

1991 ◽  
Vol 6 (3) ◽  
pp. 151-194 ◽  
Author(s):  
Pascal Van Hentenryck
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Constraint Logic Programming ◽  
Combinatorial Problems ◽  
Basic Operation ◽  
Combinatorial Search ◽  
New Class ◽  
Constraint Systems ◽  
Declarative Semantics ◽  
Relational Form

AbstractConstraint logic programming (CLP) is a generalization of logic programming (LP) where unification, the basic operation of LP languages, is replaced by constraint handling in a constraint system. The resulting languages combine the advantages of LP (declarative semantics, nondeterminism, relational form) with the efficiency of constraint-solving algorithms. For some classes of combinatorial search problems, they shorten the development time significantly while preserving most of the efficiency of imperative languages. This paper surveys this new class of programming languages from their underlying theory, to their constraint systems, and to their applications to combinatorial problems.

Sign in / Sign up

Export Citation Format

Share Document