Sciweavers

3119 search results - page 53 / 624
» General Default Logic
Sort
View
APAL
2005
73views more  APAL 2005»
13 years 7 months ago
Finite information logic
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...
Rohit Parikh, Jouko A. Väänänen
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 7 months ago
A Framework for Compiling Preferences in Logic Programs
We introduce a methodology and framework for expressing general preference information in logic programming under the answer set semantics. An ordered logic program is an extended...
James P. Delgrande, Torsten Schaub, Hans Tompits
PODS
2008
ACM
120views Database» more  PODS 2008»
14 years 7 months ago
Effective characterizations of tree logics
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
Mikolaj Bojanzyk
ATAL
2007
Springer
14 years 1 months ago
A temporal epistemic logic with a reset operation
We present an axiomatisation for an extension of a temporal epistemic logic with an epistemic “reset” operator defined on the intersection between epistemic and temporal rela...
Alessio Lomuscio, Bozena Wozna
VLSID
2002
IEEE
100views VLSI» more  VLSID 2002»
14 years 18 days ago
Layout-Driven Timing Optimization by Generalized De Morgan Transform
We propose a timing-oriented logic optimization technique called Generalized De Morgan (GDM) transform, that integrates gate resizing, net buffering and De Morgan transformation. ...
Supratik Chakraborty, Rajeev Murgai