2585 search results - page 337 / 517 » Automating Coherent Logic |
196
click to vote
TPHOL
2005
IEEE
16 years 4 days ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
183
click to vote
LPAR
2004
Springer
15 years 12 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
179
click to vote
SIGSOFT
2003
ACM
15 years 11 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
162
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Logic variables pioneered by (concurrent) logic and concurrent constraint programming are powerful mechanisms for automatically synchronizing concurrent computations. The...
179
click to vote
ICLP
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP co...