Sciweavers

2022 search results - page 45 / 405
» Complexity of Non-Monotonic Logics
Sort
View
DLT
2009
14 years 10 months ago
Branching-Time Temporal Logics with Minimal Model Quantifiers
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
Fabio Mogavero, Aniello Murano
202
Voted
LACL
2011
Springer
14 years 3 months ago
Using Logic in the Generation of Referring Expressions
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
Carlos Areces, Santiago Figueira, Daniel Gor&iacut...
98
Voted
ECCC
2007
90views more  ECCC 2007»
15 years 17 days ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
94
Voted
ICCD
1992
IEEE
83views Hardware» more  ICCD 1992»
15 years 4 months ago
Logical Verification of the NVAX CPU Chip Design
ct Digital's NVAX high-performance microprocessor has a complex logical design. A rigorous simulation-based verification effort was undertaken to ensure that there were no log...
Walker Anderson
JOLLI
1998
103views more  JOLLI 1998»
15 years 8 days ago
An Interpretation of Default Logic in Minimal Temporal Epistemic Logic
When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in thi...
Joeri Engelfriet, Jan Treur