The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 2400 of Mathematical Reviews Vol. , Issue 96d
[page]

1996
*
Mathematical Reviews
*

The proof is a corollary of our result that over non-Herbrand

*infinite*models, the well-founded semantics is more*expressive*than the three-*valued**program*completion semantics.” ...*In*particular, over*infinite*Herbrand uni- verses, the four semantics all have the same*expressive*power. ...##
###
In Praise of Strategies
[chapter]

2012
*
Lecture Notes in Computer Science
*

General PDL-

doi:10.1007/978-3-642-29326-9_6
fatcat:3atr6272gbfzhel5of5pnj5swe
*programs*now define strategies s. Note that,*in*general, these*programs*may denote arbitrary transition relations, not just uniquely*valued*functions. ... The precise definition is*an*easy exercise*in*modal*logic*(cf. van Benthem 2002). But PDL has further*uses**in*this setting. Consider any finite game M with a strategy s for player i. ... Thus, propositional dynamic*logic*does a reasonable job*in*defining explicit strategies*in*simple extensive games. ...##
###
REVISE: Logic programming and diagnosis
[chapter]

1997
*
Lecture Notes in Computer Science
*

*In*this article we describe the non-monotonic reasoning system RE-VISE that revises contradictory extended

*logic*

*programs*. ... Version 2.4 copes with problems of this size through its set representation and memoizing

*in*the WFSX interpreter. ... The behaviour of the system to be diagnosed is coded as

*an*extended

*logic*

*program*. To

*express*the assumption that the system works correctly by default we

*use*negation by default. ...

##
###
Explaining Preferences and Preferring Explanations
[chapter]

2015
*
Lecture Notes in Computer Science
*

*In*this paper we study the possibility of providing causal explanations for

*preferred*answer sets, as those obtained from

*logic*

*programs*with ordered disjunction (LPODs). ... We

*use*a recently defined multi-

*valued*semantics for answer sets based on a causal algebra and consider its direct application to LOPDs by several illustrating examples. ... For instance, it makes sense

*preferring*

*an*explanation that

*uses*the i-th choice of

*an*ordered disjunction than one that

*uses*a j-th choice with i < j. ...

##
###
Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming
[chapter]

2009
*
Lecture Notes in Computer Science
*

We

doi:10.1007/978-3-540-93920-7_14
fatcat:x65nar76wnf65dbmhyshaqjy3e
*use*temporal*logic*for the representation of various kinds of goals and*preferences*, leading to a uniform framework for integrating goals and*preferences*into agent*programming*. ...*In*this paper, we propose the*use*of goals as hard constraints and qualitative*preferences*as soft constraints for choosing a most*preferred*action among the available ones. ... Acknowledgements We would like to thank Moritz Hammer for pointing*us*to [3] . ...##
###
Functional logic programming

2010
*
Communications of the ACM
*

*In*general, there might be

*infinitely*many instantiations for the free variables of

*an*

*expression*. ... Since a demand-driven strategy computes only the

*values*that are required by the context, the previous equation might have a finite search space even

*in*the presence of regular

*expressions*with

*an*

*infinite*...

##
###
Page 5094 of Mathematical Reviews Vol. , Issue 95i
[page]

1995
*
Mathematical Reviews
*

By

*using*a different truth base, the exponential form can be applied to represent positive and negative*logic**in*fuzzy*valued**logic*as well as fuzzy linguistic*valued**logic*. ... It has been shown*in*previous works that the method is fast and stable, but there remains a problem of devising*an*effective scheme for*expressing*nonlinear fuzzy rules*in*mathematical formulas. ...##
###
From Logic to Functional Logic Programs
[article]

2022
*
arXiv
*
pre-print

*Logic*

*programming*is a flexible

*programming*paradigm due to the

*use*of predicates without a fixed data flow. ... Since amalgamated functional

*logic*languages offer flexible as well as efficient evaluation strategies, we propose

*an*opposite approach

*in*this paper. ... The application of

*an*operation f to e is denoted by juxtaposition (" f e").

*In*addition to Haskell, Curry allows free (

*logic*) variables

*in*

*program*rules (equations) and initial

*expressions*. ...

##
###
Decisions, Actions, and Games: A Logical Perspective
[chapter]

2008
*
Lecture Notes in Computer Science
*

*preferences*, as explicit parts of the

*logical*system. ...

*logic*and games Over the past decades, logicians interested

*in*rational agency and intelligent interaction studied major components of these phenomena, such as knowledge, belief, and

*preference*. ...

*In*the following game tree, players'

*preferences*are encoded

*in*the utility

*values*, as pairs '(

*value*of A,

*value*for E)'. ...

##
###
Set Constraints in Logic Programming
[chapter]

2003
*
Lecture Notes in Computer Science
*

Our

doi:10.1007/978-3-540-24609-1_16
fatcat:otj5g45pmbaujnzhw6k4gt2kzi
*programs*admit atoms of the form X, F where X is a finite set of propositional atoms and F is*an*arbitrary family of subsets of X. ... We investigate a generalization of weight-constraint*programs*with stable semantics, as implemented*in*the ASP solver smodels. ...*In*this case, one can*use*a solver such as smodels [NS00] to compute the*preferred*answers. ...##
###
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
[chapter]

2001
*
Lecture Notes in Computer Science
*

We also show that the

doi:10.1007/3-540-45635-x_23
fatcat:ksromfp5nvegnedn2tznikn7xe
*preferred*model cannot be calculated a-posteriori (i.e. compute stable models and choose the*preferred*one) but rather must be computed*in**an*intertwined fashion with the stable model ... the equation system can be "read off" the*preferred*stable model of the*logic**program*. ...*in*a given*expression**using*the above definition. ...##
###
Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective
[article]

2022
*
arXiv
*
pre-print

*Logic*

*Programs*with Ordered Disjunction (LPODs) extend classical

*logic*

*programs*with the capability of

*expressing*preferential disjunctions

*in*the heads of

*program*rules. ...

*In*this paper we obtain a purely

*logical*characterization of strong equivalence of LPODs as

*logical*equivalence

*in*a four-

*valued*

*logic*. ... Introduction

*Logic*

*Programs*with Ordered Disjunction (LPODs) (Brewka 2002; Brewka et al. 2004b) extend classical

*logic*

*programs*with the capability of

*expressing*preferential disjunctions

*in*the heads ...

##
###
The Expressive Powers of the Logic Programming Semantics

1995
*
Journal of computer and system sciences (Print)
*

*In*particular, over

*infinite*Herbrand universes, the four semantics all have the same

*expressive*power. ... Over

*infinite*Herbrand models, we consider a notion of translatability between the three-

*valued*

*program*completion and well-founded semantics which is

*in*a sense uniform

*in*the strata. ... Note that, though a

*logic*

*program*P is, by definition, finite, if D is

*an*

*infinite*EDB, then the D-instantiation of P is

*in*general

*infinite*. ...

##
###
t-DeLP: A Temporal Extension of the Defeasible Logic Programming Argumentative Framework
[chapter]

2011
*
Lecture Notes in Computer Science
*

As usual, this notion takes care of inconsistencies, and

doi:10.1007/978-3-642-23963-2_38
fatcat:4hrfqwqqxjgajnen3h5qkuo7ga
*in*particular we prove the consistency of any*logical**program*whose strict part is consistent. ... The aim of this paper is to offer*an*argumentation-based defeasible*logic*that enables forward reasoning with time. ... If σ*an**expression*, σ ζ ζ is the*expression*obtained by replacing*in*σ each occurrence of ζ by*an*occurrence of ζ . Preliminaries 2.1 Defeasible*logic**programming*DeLP. ...##
###
Page 2935 of Mathematical Reviews Vol. , Issue 90E
[page]

1990
*
Mathematical Reviews
*

*Logic*perpetual processes are defined as “

*logic*

*programs*with

*infinite*data structures”. ... When the

*prefer*- ence relation is

*an*equivalence relation, the corresponding

*logic*is monotonic. ...

« Previous

*Showing results 1 — 15 out of 60,309 results*