Sciweavers

4513 search results - page 347 / 903
» Logic programming with satisfiability
Sort
View
IBERAMIA
2010
Springer
15 years 2 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
TACAS
2005
Springer
112views Algorithms» more  TACAS 2005»
15 years 10 months ago
Java-MOP: A Monitoring Oriented Programming Environment for Java
Abstract. A Java-based tool-supported software development and analysis framework is presented, where monitoring is a foundational principle. Expressive requirements specification...
Feng Chen, Grigore Rosu
IIE
2007
75views more  IIE 2007»
15 years 4 months ago
Program and Evaluation Planning Light: Planning in the Real World
Although there are many high-quality models for program and evaluation planning, these models are often too intensive to be used in situations when time and resources are scarce. A...
Justus J. Randolph, Pasi J. Eronen
PPDP
2007
Springer
15 years 10 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano
ICFP
2010
ACM
15 years 5 months ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen